Public-key cryptography on smart cards

DOI10.1007/BFb0032364zbMath1422.94028OpenAlexW1581023635MaRDI QIDQ5235428

Dieter Gollmann, Paul J. G. Lothian, Andreas Fuchsberger, Kenneth G. Paterson, Abraham Sidiropoulos

Publication date: 10 October 2019

Published in: Cryptography: Policy and Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

modular exponentiationresidue number systemsmart cardsignature schememodular multiplication

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Computation of discrete logarithms in prime fields
• Modular Multiplication Without Trial Division
• Minimum weight modified signed-digit representations and fast exponentiation
• A public key cryptosystem and a signature scheme based on discrete logarithms
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• CORSAIR: A Smart Card for Public Key Cryptosystems
• The RSA Cryptography Processor
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Public-key cryptography on smart cards