相关论文: Riemann-Roch bases for arbitrary elliptic curve di…
For an (imaginary) hyperelliptic curve $\mathcal{H}$ of genus $g$, we determine a basis of the Riemann-Roch space $\mathcal{L}(D)$, where $D$ is a divisor with positive degree $n$, linearly equivalent to $P_1+\cdots+ P_j+(n-j)\Omega$, with…
Given an Edwards curve, we determine a basis for the Riemann-Roch space of any divisor whose support does not contain any of the two singular points. This basis allows us to compute a generating matrix for an algebraic-geometric Goppa code…
For applications in algebraic geometric codes, an explicit description of bases of Riemann-Roch spaces of divisors on function fields over finite fields is needed. We give an algorithm to compute such bases for one point divisors, and…
This paper presents an overview of the use of elliptic curves in cryptography. The security of this cryptosystem is based on the discrete logarithm problem, which appears to be much harder compared to the discrete logarithm problem in other…
Elliptic curve cryptography has received great attention in recent years due to its high resistance against modern cryptanalysis. The aim of this article is to present efficient generators to generate substitution boxes (S-boxes) and pseudo…
We discuss the use of elliptic curves in cryptography on high-dimensional surfaces. In particular, instead of a Diffie-Hellman key exchange protocol written in the form of a bi-dimensional row, where the elements are made up with 256 bits,…
This paper is concerned with the construction of algebraic geometric codes defined from Kummer extensions. It plays a significant role in the study of such codes to describe bases for the Riemann-Roch spaces associated with totally ramified…
Two problems are addressed: reduction of an arbitrary degree non-special divisor to the equivalent divisor of the degree equal to genus of a curve, and addition of divisors of arbitrary degrees. The hyperelliptic case is considered as the…
In the theory of algebraic function fields and their applications to the information theory, the Riemann-Roch theorem plays a fundamental role. But its use, delicate in general, is efficient and practical for applications especially in the…
Simulation of physical systems is one of the most promising use cases of future digital quantum computers. In this work we systematically analyze the quantum circuit complexities of block encoding the discretized elliptic operators that…
We investigate multi-point algebraic geometric codes defined from curves related to the generalized Hermitian curve introduced by Alp Bassa, Peter Beelen, Arnaldo Garcia, and Henning Stichtenoth. Our main result is to find a basis of the…
Discrete Laplacian operators arise ubiquitously in scientific computing and frequently appear in quantum algorithms for tasks such as linear algebra, Hamiltonian simulation, and partial differential equations. Block encoding provides the…
The Discrete Logarithm Problem (DLP) for elliptic curves has been extensively studied since, for instance, it is the core of the security of cryptosystems like Elliptic Curve Cryptography (ECC). In this paper, we present an attack to the…
Short Weierstrass's elliptic curves with underlying hard Elliptic Curve Discrete Logarithm Problems was widely used in Cryptographic applications. This paper introduces a new security notation 'trusted security' for computation methods of…
A class of linear codes that extends classic Goppa codes to a non-commutative context is defined. An efficient decoding algorithm, based on the solution of a non-commutative key equation, is designed. We show how the parameters of these…
In algebraic geometry, there is a reduction algorithm that transforms the unreduced divisor into a unique reduced divisor, which existence is guaranteed by the Riemann-Roch theorem. We discuss application of this algorithm to construction…
We consider representations of algebraic tori $T_n(F_q)$ over finite fields. We make use of normal elliptic bases to show that, for infinitely many squarefree integers $n$ and infinitely many values of $q$, we can encode $m$ torus elements,…
This article discusses the security of McEliece-like encryption schemes using subspace subcodes of Reed-Solomon codes, i.e. subcodes of Reed-Solomon codes over $\mathbb{F}_{q^m}$ whose entries lie in a fixed collection of…
We give polynomial time attacks on the McEliece public key cryptosystem based either on algebraic geometry (AG) codes or on small codimensional subcodes of AG codes. These attacks consist in the blind reconstruction either of an Error…
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…