Generating Provable Primes Efficiently on Embedded Devices

DOI10.1007/978-3-642-30057-8_22MaRDI QIDQ2900229zbMATH OpenOpenAlexFDO

Authors Christophe Clavier, Benoit Feix, Loïc Thierry, Pascal Paillier

Publication date 20 July 2012

Published in Public Key Cryptography – PKC 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30057-8_22

zbMATH Keywords

cryptographic acceleratorsembedded softwaremodular exponentiationPocklington's theoremprimality provingprime numberspublic key cryptography

Mathematics Subject Classification ID

Primality (11Y11) Cryptography (94A60)

Recommendations

• Fast Generation of Prime Numbers on Portable Devices: An Update
• scientific article; zbMATH DE number 1406787
• scientific article; zbMATH DE number 1759305
• Efficient method for generating strong primes with constraint of bit length
• scientific article; zbMATH DE number 1588470
• scientific article; zbMATH DE number 579167
• Improved primality proving with Eisenstein pseudocubes

Cited in

(1)

• Efficient address generation for prime factor algorithms (digital signal processing)

This page was built for publication: Generating Provable Primes Efficiently on Embedded Devices

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