On using carmichael numbers for public key encryption systems

6Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that the inadvertent use of a Carmichael number instead of a prime factor in the modulus of an RSA cryptosystem is likely to make the system fatally vulnerable, but that such numbers may be detected.

Cite

CITATION STYLE

APA

Pinch, R. G. E. (1997). On using carmichael numbers for public key encryption systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1355, pp. 265–269). Springer Verlag. https://doi.org/10.1007/bfb0024472

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free