A new distributed primality test for shared RSA keys using quadratic fields

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2384, Issue , 2002, Pages 1-16

  Biehl, Ingrid ^a   Takagi, Tsuyoshi ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Distributed RSA; Parallel computation; Primality test; Quadratic fields

Indexed keywords

SECURITY OF DATA;

CLASS GROUP; DISCRETE LOGARITHM PROBLEMS; DISTRIBUTED RSA; GENERATION METHOD; MULTI-PRIME RSA; PARALLEL COMPUTATION; PRIMALITY TESTS; QUADRATIC FIELDS;

TESTING;

EID: 84947417695     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45450-0_1     Document Type: Conference Paper

References (16)

1. [BB97]. I. Biehl and J. Buchmann, “An analysis of the reduction algorithms for binary quadratic forms”, Technical Report No. TI-26/97, Technische Universitat Darmstadt, (1997).
2. [BGW88]. M. Ben-Or, S. Goldwasser and A. Wigderson, “Completeness theorems for non-cryptographic fault tolerant distributed computation”, STOC, (1988), pp.1-10.
3. D. Boneh and M. Franklin, “Efficient generation of shared RSA keys”, CRYPTO’97, LNCS 1294, (1997), Springer, pp.425-439.
4. D. Boneh and J. Horwitz, “Generating a product of three primes with an unknown factorization”, The third Algorithmic Number Theory Symposium, ANTS III, LNCS 1423, (1998), Springer, pp.237-251.
5. J. Buchmann and H. C. Williams, “A key-exchange system based on imaginary quadratic fields”, Journal of Cryptology, 1, (1988), Springer, pp.107-118.
6. [CGH00]. D. Catalano, R. Gennaro, S. Halevi, “Computing Inverses over a Shared Secret Modulus,” EUROCRYPT 2000, LNCS 1807, (2000), pp.190-206.
7. D. A. Cox: Primes of the form x2 + ny2, John Wiley & Sons, New York, (1989).
8. [DK01]. I. Damgard and M. Koprowski, “Practical Threshold RSA Signatures without a Trusted Dealer,” EUROCRYPT 2001, LNCS 2045, (2001), pp.152-165.
9. [FS01]. P.-A. Fouque and J. Stern, “Fully Distributed Threshold RSA under Standard Assumptions,” ASIACRYPT 2001, LNCS 2248, (2001), pp.310-330.
10. M. J. Jacobson Jr., “Subexponential Class Group Computation in Quadratic Orders”, PhD Thesis, Technical University of Darmstadt, (1999).
11. [JJ99]. E. Jaulmes and A. Joux, “A NICE cryptanalysis”, EUROCRYPT 2000, LNCS 1807, (2000), pp.382-391.
12. LiDIA - A library for computational number theory. Technische Universitat Darmstadt, Germany.
13. [MSY01]. S. Miyazaki, K. Sakurai, and M. Yung, “On Distributed Cryptographic Protocols for Threshold RSA Signing and Decrypting with No Dealer,” IEICE Transaction, Vol.E84-A, No.5, (2001), pp.1177-1183.
14. H. Riesel, Prime Numbers and Computer Methods for Factorization, Second Edition, Prog. in Math. 126, Birkhauser, 1994.
15. PKCS, Public-Key Cryptography Standards, RSA Laboratories, http://www.rsasecurity.com/rsalabs/pkcs/index.html.
16. V. Shoup, “Practical Threshold Signatures,” Eurocrypt 2000, LNCS 1807, (2000), pp.207-220.