23 search results - page 3 / 5 » Large primes and Fermat factors |
ISSAC
1994
Springer
15 years 1 months ago
1994
Springer
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
CSJM
2006
14 years 9 months ago
2006
A new method is proposed to design short signature schemes based on difficulty of factorizing a composite number n = qr, where q and r are two large primes. Using the method new d...
ASIACRYPT
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
NDSS
1999
IEEE
15 years 1 months ago
1999
IEEE
We describe an implementation of a distributed algorithm to generate a shared RSA key. At the end of the computation, an RSA modulus N = pq is publicly known. All servers involved...