Short RSA keys and their generation

Abstract

This paper deals with the problem of generating RSA moduli having a predetermined set of bits. It would appear to be of practical interest if one could construct their modulus so that, for example, some of the bits are the ASCII representation of their identification information (i.e., name, address, etc.). This could lead to a savings in both bandwidth for data transmission and storage. A theoretical question which arises in connection with this is to determine the maximum number of bits which can be specified so that the modulus can be determined in polynomial time and, of course, security is maintained. © 1995, International Association for Cryptologic Research. All rights reserved.