FOCM
2006
13 years 11 months ago
2006
The main result of this paper is a new version of Newton-Hensel lifting that relates to interpolation questions. It allows one to lift polynomials in Z[x] from information modulo a...
CHES
2000
Springer
14 years 2 months ago
2000
Springer
The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appear...
CHES
2006
Springer
14 years 2 months ago
2006
Springer
The generation of prime numbers underlies the use of most public-key cryptosystems, essentially as a primitive needed for the creation of RSA key pairs. Surprisingly enough, despit...
ISSAC
1997
Springer
14 years 3 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
CODCRY
2009
Springer
14 years 5 months ago
2009
Springer
In this paper, we consider the norm-trace curves which are defined by the equation yqr−1 + yqr−2 + · · · + y = x qr−1 q−1 over IFqr where q is a power of a prime number...