Generating a product of three primes with an unknown factorization

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

Volumn 1423, Issue , 1998, Pages 237-251

  Boneh, Dan ^a   Horwitz, Jeremy ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FACTORIZATION; NUMBER THEORY;

PRIMALITY TESTS;

PRODUCT DESIGN;

EID: 84947749920     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054866     Document Type: Conference Paper

References (16)

1. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault tolerant distributed computation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 1-10. ACM Press, 1988.
2. D. Boneh and M. Franklin. Efficient generation of shared RSA keys. In Proceedings of Advances in Cryptology: CRYPTO '97, pages 425-439. Lecture Notes in Computer Science, Springer-Verlag, New York, 1998.
3. M. Blum and S. Goldwasser. An efficient probabilistic public key encryption scheme that hides all partial information. In Proceedings of Advances in Cryptology: CRYPTO '84, pages 289-302. Lecture Notes in Computer Science, Springer-Verlag, New York, 1985.
4. D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 11-19. ACM Press, 1988.
5. C. Cocks. Split knowledge generation of RSA parameters. Available from the author (cliff_cockso@cesg.gov.uk).
6. R. Fagin, M. Naor, and P. Winkler. Comparing information without leaking it. Communications of the ACM, 39(5):77-85, May 1996.
7. Y. Frankel. A practical protocol for large group oriented networks. In Proceedings of Advances in Cryptology: EUROCRYPT '88, pages 56-61. Lecture Notes in Computer Science, Springer-Verlag, New York, 1990.
8. Y. Frankel, P. MacKenzie, and M. Yung. Robust efficient distributed RSA key generation. Preprint.
9. P. Gemmel. An introduction to threshold cryptography. CryptoBytes (a technical newsletter of RSA Laboratories), 2(7), 1997.
10. J. Grantham. A probable prime test with high confidence. Available online (http://ww.dark.net/pub/grantham/pseudo/).
11. R. Peralta and J. van de Graaf. A simple and secure way to show the validity of your public key. In Proceedings of Advances in Cryptology: CRYPTO '87, pages 128-134. Lecture Notes in Computer Science, Springer-Verlag, New York, 1988.
12. A. Lenstra and H. W. Lenstra ed. The development of the number field sieve. Lecture Notes in Computer Science 1554, Springer-Verlag, 1994.
13. H. W. Lenstra. Factoring integers with elliptic curves. Annals of Mathematics, 126:649-673, 1987.
14. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, November 1979.
15. M. Wiener. Cryptanalysis of short RSA secret exponents. IEEE Transactions on Information Theory, 36(3):553-558, 1990.
16. A. Yao. How to generate and exchange secrets. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 162-167. IEEE Press, 1986.