Improvements to RSA key generation and CRT on embedded devices

DOI10.1007/978-3-030-75539-3_26OpenAlexW3115372621MaRDI QIDQ826302

Qinglai Xiao, Mike Hamburg, Mike Tunstall

Publication date: 20 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75539-3_26

zbMATH Keywords

RSAprime generation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic algorithm for testing primality
• Parallel collision search with cryptanalytic applications
• Post-quantum RSA
• Elliptic Curves and Primality Proving
• Modular Multiplication Without Trial Division
• Fast Generation of Prime Numbers on Portable Devices: An Update
• New directions in cryptography
• The Pseudoprimes to 25 ⋅10 9
• A method for obtaining digital signatures and public-key cryptosystems
• GCD-Free Algorithms for Computing Modular Inverses

This page was built for publication: Improvements to RSA key generation and CRT on embedded devices