Efficient generation of prime numbers
From MaRDI portal
Recommendations
- Fast Generation of Prime Numbers on Portable Devices: An Update
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- scientific article; zbMATH DE number 697832
- Fast generation of secure RSA-moduli with almost maximal diversity
- Prime generation with the Demytko-Miller-Trbovich algorithm
Cited in
(20)- Prime-number algorithm for public-key systems
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Generating safe primes
- Primeless factoring-based cryptography. Solving the complexity bottleneck of public-key generation
- Generating Provable Primes Efficiently on Embedded Devices
- On fast calculation of addition chains for isogeny-based cryptography
- Prime number generators
- scientific article; zbMATH DE number 3891448 (Why is no real title available?)
- Efficient method for generating strong primes with constraint of bit length
- Efficient address generation for prime factor algorithms (digital signal processing)
- Fast Generation of Prime Numbers on Portable Devices: An Update
- Generation of an RSA scheme in resource-constrained environments
- scientific article; zbMATH DE number 697832 (Why is no real title available?)
- Prime generation with the Demytko-Miller-Trbovich algorithm
- Fast generation of provable primes using search in arithmetic progressions
- Close to uniform prime number generation with fewer random bits
- Progress in Cryptology - INDOCRYPT 2003
- RSA Moduli with a Predetermined Portion: Techniques and Applications
- Improvements to RSA key generation and CRT on embedded devices
This page was built for publication: Efficient generation of prime numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536239)
