A design of fast pipelined modular multiplier based on a diminished-radix algorithm

DOI10.1007/BF00203816zbMath0782.68040OpenAlexW2079648223MaRDI QIDQ1312101

Glenn Orton, Lloyd Peppard, Stafford E. Tavares

Publication date: 24 February 1994

Published in: Journal of Cryptology (Search for Journal in Brave)

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

zbMATH Keywords

modular exponentiationVLSIcomputer arithmeticCMOSmodular- multiplication

Mathematics Subject Classification ID

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

Related Items (1)

RSA Moduli with a Predetermined Portion: Techniques and Applications

Cites Work

• Modular Multiplication Without Trial Division
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• On Primality Tests
• A method for obtaining digital signatures and public-key cryptosystems
• RSA Chips (Past/Present/Future) (Extended abstract)
• Majority Gate Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A design of fast pipelined modular multiplier based on a diminished-radix algorithm