Fast generation of secure RSA-moduli with almost maximal diversity

DOI10.1007/3-540-46885-4_60MaRDI QIDQ3973160zbMATH OpenFDO

Authors Ueli M. Maurer

Publication date 26 June 1992

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46885-4_60

zbMATH Keywords

generation of large primesprimalityRSA cryptosystem

Mathematics Subject Classification ID

Primality (11Y11) Cryptography (94A60)

Recommendations

• Fast Generation of RSA Keys Using Smooth Integers
• Fast RSA-type cryptosystem modulo p^k q
• Fast distributed RSA key generation for semi-honest and malicious adversaries
• On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
• Fast RNS division algorithms for fixed divisors with application to RSA encryption
• Efficient generation of shared RSA keys. (Extended abstract)
• An ultrafast cryptographically secure pseudorandom number generator
• scientific article; zbMATH DE number 1950337
• Generation of an RSA scheme in resource-constrained environments
• Efficient generation of shared RSA keys

Cited in

(20)

• On RSA moduli with almost half of the bits prescribed
• On using primes for public key encryption systems
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• On RSA moduli with prescribed bit patterns
• A simple approach for generating RSA keys
• Efficient method for generating strong primes with constraint of bit length
• Generation of an RSA scheme in resource-constrained environments
• Strong Primes are Easy to Find
• Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes
• Some considerations concerning the selection of RSA moduli
• Generating RSA moduli with a predetermined portion
• Prime generation with the Demytko-Miller-Trbovich algorithm
• Efficient generation of prime numbers
• Application of Parallel Virtual Machine Framework to the Strong Prime Problem
• scientific article; zbMATH DE number 810480 (Why is no real title available?)
• Notions for RSA integers
• Calculation of random pairs of primes whose product lies in a given short interval
• RSA Moduli with a Predetermined Portion: Techniques and Applications
• Almost uniform density of power residues and the provable security of ESIGN
• Constant-round perfect zero-knowledge computationally convincing protocols

This page was built for publication: Fast generation of secure RSA-moduli with almost maximal diversity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3973160)