Skip to main content
Conference ProceedingsOPEN ACCESS

Generating RSA moduli with a predetermined portion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1514 1-10
DOI: 10.1007/3-540-49649-1_1
61Citations
Citations of this article
51Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper reviews and generalizes a method to generate RSA moduli with a predetermined portion. The potential advantages of the resulting methods are discussed: both the storage and the computational requirements of the RSA cryptosystem can be considerably reduced. The constructions are as efficient as generation of regular RSA moduli, and the resulting moduli do not seem to offer less security than regular RSA moduli.

Cite

CITATION STYLE

APA

Lenstra, A. K. (1998). Generating RSA moduli with a predetermined portion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1514, pp. 1–10). Springer Verlag. https://doi.org/10.1007/3-540-49649-1_1

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