Claude Crepeau, Alain Slakmon  Home/Search
Context
Related
| crypto.cs.mcgill.ca/~crepeau/...CS02.ps crypto.cs.mcgill.ca/~crepeau...CS02.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.mcgill.ca/~crepe...proceedings (more) Homepages: C.Crepeau |
Rate this article:      (best)View Comments (0) |
Abstract: We present extremely simple ways of embedding a backdoor in the key generation of RSA. Three of our schemes generate two genuinely random primes p and q of a given size, to obtain their public product n = pq. However they generate private/public exponents pairs (d, e) in such a way that appears very random while allowing the author of the scheme to easily factor n given only the public information (n, e). Our last scheme, similar to the PAP method of Young and Yung, but more secure, works for... (Update)
Similar documents (at the sentence level):
78.9%: Simple Backdoors for RSA Key Generation - Crepeau, Slakmon (2002) (Correct)
Active bibliography (related documents): More All
0.3: A Comparison of Two Ontologies of Regions - Botke, Hoede (2000) (Correct)
0.2: Auditable Privacy: - On Tamper-Evident Mix (Correct)
0.2: The Design and Implementation of Protocol-Based Hidden.. - Goh, Boneh, Golle, Pinkas (2003) (Correct)
Similar documents based on text: More All
0.3: Efficient Generation of Shared RSA keys - Boneh, Franklin (1997) (Correct)
0.3: Generating RSA Keys on a Handheld Using an Untrusted Server - Modadugu, Boneh, Kim (2000) (Correct)
0.3: Cryptanalysis of the RSA Schemes with Short Secret Exponent.. - Durfee, Nguyen (2000) (Correct)
BibTeX entry: (Update)
@proceedings{ crepeau-simple,
author = {Claude Cr\'epeau and Alain Slakmon},
editor = {Marc Joye},
title = {Topics in Cryptology - CT-RSA 2003, The Cryptographers' Track
at the RSA Conference 2003, San Francisco, CA, USA, April 13-17 2003},
booktitle = {CT-RSA},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2612},
year = {2003},
isbn = {3-540-00847-0},
url = {citeseer.ist.psu.edu/article/crepeau02simple.html} }
Citations (may not include all citations):1529 A method for obtaining digital signatures and public-key cry.. - Rivest, Shamir et al. - 1978
92 Riemann's hypothesis and tests for primality (context) - Miller - 1976
59 Cryptanalysis of short rsa secret exponents (context) - Wiener - 1990
26 Cryptanalysis of rsa with private key d less than n - Boneh, Durfee - 2000
24 Finding a small root of a bivariate integer equation; factor.. (context) - Coppersmith - 1996
17 An attack on rsa given a small fraction of the private key b.. (context) - Boneh, Durfee et al. - 1998
5 Cryptanalysis of rsa with small prime di#erence (context) - de Weger - 2002
4 or: Should we trust Capstone (context) - Young, Yung et al. - 1996
3 mail communication (context) - Vaudenay, e- - 2001
2 the RSA hidden small exponent method (context) - epeau, Wong - 2001
2 cient factoring based on partial information (context) - Rivest, Shamir - 1985
2 Sur des methodes et algorithmes de factorisation et leur app.. (context) - Slakmon - 2000
1 An attack on rsa given a small fraction of the private key b.. (context) - Lenstra - 1998
1 Generating rsa moduli with predetermined portion (context) - Joye, Paillier et al.
Documents on the same site (http://www.cs.mcgill.ca/~crepeau/proceedings.html): More
A zero-knowledge Poker protocol that achieves confidentiality of.. - Crépeau (1986) (Correct)
Weakening Security Assumptions and Oblivious Transfer - Crépeau, al. (Correct)
Computationally convincing proofs of knowledge.. - Brassard, Crépeau.. (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC