Analyzing standards for RSA integers

Details Analyzing standards for RSA integers Analyzing standards for RSA integers

2011-04-21

arxiv.org/abs/1104.4356v2

Computer Science

Cryptography and Security

Scientific paper

The key-generation algorithm for the RSA cryptosystem is specified in several standards, such as PKCS#1, IEEE 1363-2000, FIPS 186-3, ANSI X9.44, or ISO/IEC 18033-2. All of them substantially differ in their requirements. This indicates that for computing a "secure" RSA modulus it does not matter how exactly one generates RSA integers. In this work we show that this is indeed the case to a large extend: First, we give a theoretical framework that will enable us to easily compute the entropy of the output distribution of the considered standards and show that it is comparatively high. To do so, we compute for each standard the number of integers they define (up to an error of very small order) and discuss different methods of generating integers of a specific form. Second, we show that factoring such integers is hard, provided factoring a product of two primes of similar size is hard.

Affiliated with

Also associated with

No associations

Rating

Analyzing standards for RSA integers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Analyzing standards for RSA integers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analyzing standards for RSA integers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-330015