20 search results - page 2 / 4 » Generating a Product of Three Primes with an Unknown Factori... |
IJNSEC
2008
13 years 7 months ago
2008
The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the hel...
DM
2007
13 years 7 months ago
2007
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
NDSS
1999
IEEE
13 years 11 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...
MOC
2011
12 years 10 months ago
2011
Abstract. We present three algorithms to calculate Φn(z), the nth cyclotomic polynomial. The first algorithm calculates Φn(z) by a series of polynomial divisions, which we perfo...
STACS
1989
Springer
13 years 11 months ago
1989
Springer
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...