Fast Generation of Prime Numbers on Portable Devices: An Update

DOI10.1007/11894063_13MaRDI QIDQ3522152zbMATH OpenOpenAlexFDO

Authors Marc Joye, Pascal Paillier

Publication date 29 August 2008

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

Full work available at URL https://doi.org/10.1007/11894063_13

zbMATH Keywords

RSApublic-key cryptographyprimality testingsmart cardsembedded softwareefficient implementationsprime number generationcryptoprocessorsPDAs

Mathematics Subject Classification ID

Cryptography (94A60) Primality (11Y11)

Recommendations

• scientific article; zbMATH DE number 1759305
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• scientific article; zbMATH DE number 697832
• Prime-number algorithm for public-key systems
• scientific article; zbMATH DE number 1024026

Cited in

(8)

• Improvements to RSA key generation and CRT on embedded devices
• 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
• scientific article; zbMATH DE number 697832 (Why is no real title available?)
• Analyzing Standards for RSA Integers
• scientific article; zbMATH DE number 1759305 (Why is no real title available?)
• RSA Moduli with a Predetermined Portion: Techniques and Applications

This page was built for publication: Fast Generation of Prime Numbers on Portable Devices: An Update

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