Proportion of primes generated by strong prime methods
Proportion of primes generated by strong prime methods
The numbers of primes generated by two prime generation methods are evaluated. The methods considered generate strong primes for cryptographic use in the RSA public-key cryptosystem. The results show that they generate sufficient primes to resist cryptanalytic attack by prime enumeration for the sizes of primes used to guard against factorisation attack.
135-136
Shawe-Taylor, J.
c32d0ee4-b422-491f-8c28-78663851d6db
1992
Shawe-Taylor, J.
c32d0ee4-b422-491f-8c28-78663851d6db
Shawe-Taylor, J.
(1992)
Proportion of primes generated by strong prime methods.
Electronics Letters, 28 (2), .
Abstract
The numbers of primes generated by two prime generation methods are evaluated. The methods considered generate strong primes for cryptographic use in the RSA public-key cryptosystem. The results show that they generate sufficient primes to resist cryptanalytic attack by prime enumeration for the sizes of primes used to guard against factorisation attack.
Text
ProportionOfPrimesGeneratedStrong.pdf
- Other
More information
Published date: 1992
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 259823
URI: http://eprints.soton.ac.uk/id/eprint/259823
ISSN: 0013-5194
PURE UUID: efaf464a-184b-47ef-8911-cbafe6385d50
Catalogue record
Date deposited: 24 Aug 2004
Last modified: 14 Mar 2024 06:28
Export record
Contributors
Author:
J. Shawe-Taylor
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics