Related papers: On Using Expansions to the Base of -2
The dimension of spaces of global sections for line bundles on semistable curves parametrized by the compactified Picard scheme is studied. The theorem of Riemann is shown to hold. The theorem of Clifford is shown to hold in the following…
Elliptic curves over finite fields GF(2^n) play a prominent role in modern cryptography. Published quantum algorithms dealing with such curves build on a short Weierstrass form in combination with affine or projective coordinates. In this…
We give a detailed account of the use of $\mathbb{Q}$-curve reductions to construct elliptic curves over $\mathbb{F}\_{p^2}$ with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in…
The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose…
Globally irreducible nodes (i.e. nodes whose branches belong to the same irreducible component) have mild effects on the most common topological invariants of an algebraic curve. In other words, adding a globally irreducible node (simple…
The development of secure cryptographic protocols and the subsequent attack mechanisms have been placed in the literature with the utmost curiosity. While sophisticated quantum attacks bring a concern to the classical cryptographic…
All binary plane curves of degree less than 7 are examined for curves with a large number of Fq rational points on their smooth model, for q = 2^m ; m = 3, 4,...,11. Previous results are improved, and many new curves are found meeting or…
Improved expansion in width is applied to a curved domain wall in nonrelativistic dissipative $\lambda(\Phi^2 - v^2)^2 $ model with real scalar order parameter $\Phi$. Approximate analytic description of such a domain wall to second order…
We compute the Picard group of the moduli stack of elliptic curves and its canonical compactification over general base schemes.
The Discrete Logarithm Problem is well-known among cryptographers, for its computational hardness that grants security to some of the most commonly used cryptosystems these days. Still, many of these are limited to a small number of…
With the recent popularity of graphical clustering methods, there has been an increased focus on the information between samples. We show how learning cluster structure using edge features naturally and simultaneously determines the most…
We address a cryptanalysis of two protocols based on the supposed difficulty of discrete logarithm problem on (semi) groups of matrices over a group ring. We can find the secret key and break entirely the protocols.
In this short note, we develop a novel idea of a bilinear cryptosystem using the discrete logarithm problem in matrices. These matrices come from a linear representation of a finite $p$-group of class 2. We discuss an example at the end.
Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the…
Efficient scalar multiplication is critical for enhancing the performance of elliptic curve cryptography (ECC), especially in applications requiring large-scale or real-time cryptographic operations. This paper proposes an M-ary…
Cryptography is the study of techniques for ensuring the secrecy and authentication of the information. Public-key encryption schemes are secure only if the authenticity of the public-key is assured. Elliptic curve arithmetic can be used to…
We construct generally applicable small-loss rate expansions for the density operator of an open system. Successive terms of those expansions yield characteristic loss rates for dissipation processes. Three applications are presented in…
We study a new flexible method to extend linearly the graph of a non-linear, and usually not bijective, function so that the resulting extension is a bijection. Our motivation comes from cryptography. Examples from symmetric cryptography…
We introduce adequate concepts of expansion of a digraph to obtain a sequential construction of minimal strong digraphs. We characterize the class of minimal strong digraphs whose expansion preserves the property of minimality. We prove…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…