2009
DOI: 10.1145/1595453.1595483
|View full text |Cite
|
Sign up to set email alerts
|

Degenerate keys for RSA encryption

Abstract: Some keys for the RSA public key cryptosystem fail to encrypt all possible plaintext messages. A necessary and sufficient condition for these degenerate keys is given. The probability of choosing such a key, when choosing keys at random, is presented. The impact of degenerate keys in an academic setting is discussed.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…The last type of cryptography is considered the most revolutionary change in the cryptography science [4], [5]. RSA is considered one of the most effective algorithm that can be used for both encryption and digital signature [6]- [8]. The strength of the algorithm depends on the factorization problem.…”
Section: Introductionmentioning
confidence: 99%
“…The last type of cryptography is considered the most revolutionary change in the cryptography science [4], [5]. RSA is considered one of the most effective algorithm that can be used for both encryption and digital signature [6]- [8]. The strength of the algorithm depends on the factorization problem.…”
Section: Introductionmentioning
confidence: 99%