Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications

DOI10.1007/BF01388505zbMath0814.94016OpenAlexW2004022655MaRDI QIDQ1344528

David M'Raïhi, Dan Raphaeli, David Naccache

Publication date: 20 June 1995

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

cryptosystemcryptographic keysMontgomery's algorithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Parallel algorithms in computer science (68W10)

Uses Software

• DSP56000

Cites Work

• Modular Multiplication Without Trial Division
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications