Computing Igusa's local zeta functions of univariate polynomials, and linear feedback shift registers.
Let be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field . The field of definition of is the ring class field of the order. If the prime splits completely in , then we can reduce modulo one the factors of and get a curve defined over . The trace of the Frobenius of is known up to sign and we need a fast way to find this sign, in the context of the Elliptic Curve Primality Proving algorithm (ECPP). For this purpose, we propose...
In [22], the authors proved an explicit formula for the arithmetic intersection number on the Siegel moduli space of abelian surfaces, under some assumptions on the quartic CM field . These intersection numbers allow one to compute the denominators of Igusa class polynomials, which has important applications to the construction of genus curves for use in cryptography. One of the main tools in the proof was a previous result of the authors [21] generalizing the singular moduli formula of Gross...
The purpose of the present article is the study of duals of functional codes on algebraic surfaces. We give a direct geometrical description of them, using differentials. Even if this description is less trivial, it can be regarded as a natural extension to surfaces of the result asserting that the dual of a functional code on a curve is the differential code . We study the parameters of such codes and state a lower bound for their minimum distance. Using this bound, one can study some examples...
The Legendre symbol has been used to construct sequences with ideal cross-correlation, but it was never used in the arithmetic cross-correlation. In this paper, a new class of generalized Legendre sequences are described and analyzed with respect to their period, distributional, arithmetic cross-correlation and distinctness properties. This analysis gives a new approach to study the connection between the Legendre symbol and the arithmetic cross-correlation. In the end of this paper, possible application...
Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the case of multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for the multisequences with pn-period, we discuss the relation between sequences and their Fourier coefficients. Based on the relation, we determine a lower bound for the number of multisequences with given joint 2-adic complexity.
Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the case of multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for the multisequences with pn-period, we discuss the relation between sequences and their Fourier coefficients. Based on the relation, we determine a lower bound for the number of multisequences...
We consider digit expansions with an endomorphism of an Abelian group. In such a numeral system, the -NAF condition (each block of consecutive digits contains at most one nonzero) is shown to minimise the Hamming weight over all expansions with the same digit set if and only if it fulfills the subadditivity condition (the sum of every two expansions of weight admits an optimal -NAF).This result is then applied to imaginary quadratic bases, which are used for scalar multiplication in elliptic...
Nous montrons dans la première partie l’existence d’un prolongement méromorphe à tout le plan complexe et explicitons les propriétés et quelques conséquences, d’une large classe de séries zêta des hauteurs associées à l’espace projectif
We connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic derivative.
We study the functional codes defined on a projective algebraic variety , in the case where is a non-degenerate Hermitian surface. We first give some bounds for , which are better than the ones known. We compute the number of codewords reaching the second weight. We also estimate the third weight, show the geometrical structure of the codewords reaching this third weight and compute their number. The paper ends with a conjecture on the fourth weight and the fifth weight of the code .