scientific article; zbMATH DE number 1759305

MaRDI QIDQ4536239zbMATH OpenFDO

Authors Marc Joye, Pascal Paillier, Serge Vaudenay

Publication date 28 November 2002

zbMATH Keywords

RSAkey generationsmart cardsDSAprime number generationcrypto-processors

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

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
• scientific article; zbMATH DE number 16481
• scientific article; zbMATH DE number 1024026

Cited in

(18)

• Improvements to RSA key generation and CRT on embedded devices
• Prime number generators
• Generating safe primes
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• Generating Provable Primes Efficiently on Embedded Devices
• Efficient cryptosystems from \(2^k\)-th power residue symbols
• Generation of an RSA scheme in resource-constrained environments
• On fast calculation of addition chains for isogeny-based cryptography
• Efficient address generation for prime factor algorithms (digital signal processing)
• Progress in Cryptology - INDOCRYPT 2003
• scientific article; zbMATH DE number 697832 (Why is no real title available?)
• Close to uniform prime number generation with fewer random bits
• Fast Generation of Prime Numbers on Portable Devices: An Update
• Primeless factoring-based cryptography. Solving the complexity bottleneck of public-key generation
• scientific article; zbMATH DE number 3891448 (Why is no real title available?)
• RSA Moduli with a Predetermined Portion: Techniques and Applications
• scientific article; zbMATH DE number 1406787 (Why is no real title available?)
• Efficient method for generating strong primes with constraint of bit length

This page was built for publication:

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