Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques

DOI10.1016/j.ipl.2016.11.007zbMath1416.94059OpenAlexW2558935252MaRDI QIDQ503609

Ramasubramanian N., Satyanarayana Vollala

Publication date: 13 January 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.11.007

zbMATH Keywords

cryptographymodular exponentiationpublic-key cryptographymodular multiplicationMontgomery modular multiplier

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Uses Software

• Curve25519

Cites Work

• Unnamed Item
• Unnamed Item
• High-performance hardware of the sliding-window method for parallel computation of modular exponentiations
• Analysis of sliding window techniques for exponentiation
• Modular Multiplication Without Trial Division
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• A Survey of Fast Exponentiation Methods
• A New Algorithm for High-Speed Modular Multiplication Design
• Scalable Montgomery Modular Multiplication Architecture with Low-Latency and Low-Memory Bandwidth Requirement
• Public Key Cryptography - PKC 2006

This page was built for publication: Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques