Generating RSA moduli with a predetermined portion
Lenstra, Arjen K.
1998

Files

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

Details

Title Generating RSA moduli with a predetermined portion
Author(s) Lenstra, Arjen K.
Published in Advances in Cryptology — ASIACRYPT’98
Series Lecture Notes in Computer Science, 1514
Pages 1-10
Conference Advances in Cryptology - ASIACRYPT '98. International Conference on the Theory and Applications of Cryptology and Information Security, Beijing, China, October 18–22, 1998
Date 1998
Keywords
DOI https://doi.org/10.1007/3-540-49649-1_1
Laboratories LACAL
Record Appears in Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LACAL - Laboratory for cryptologic algorithms
Peer-reviewed publications
Work outside EPFL
Conference Papers
Published
Record creation date 2010-06-24

Actions

Preview