Fast Generation of Prime Numbers on Portable Devices: An Update

DOI10.1007/11894063_13zbMATH Open1300.94067OpenAlexW1557625911MaRDI QIDQ3522152FDOQ3522152

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

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

zbMATH Keywords

RSApublic-key cryptographyprimality testingsmart cardsembedded softwareefficient implementationsprime number generationcryptoprocessorsPDAs

Mathematics Subject Classification ID

Cryptography (94A60) Primality (11Y11)

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
• Title not available (Why is that?)
• Analyzing Standards for RSA Integers
• Title not available (Why is that?)
• 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)