Abstract
This chapter discusses the better performing approaches for modular exponential techniques that are adaptable by the different architectures of PKC. The importance of PKC in the field of information security including militarily level security is decisive. The security of these PKCs depends upon their complex arithmetic problems (e.g. IFP and DLP) which include modular exponentiation as a critical operation. Modular exponentiation is an expensive operation, that is comprised of a series of modular multiplications. The overall performance of PKC is affected by the efficient implementation of modular exponentiation. There are different ways of improving the performance of modular exponentiation, either reduce the modular multiplication operation’s internal architecture to reduce the latency, or reduce the number of modular multiplications required for the computation of modular exponentiation. This chapter discusses the techniques of reducing the number of the required modular multiplications by Bit Forwarding (BFW) techniques and how they can be implemented. The Montgomery multiplication algorithm is modified according to the requirements of BFW techniques. There are two varieties of Montgomery multiplication discussed:
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bar-El H (2002) Security implications of hardware vs. software cryptographic modules. Discretix White Paper
Batina L, Örs SB, Preneel B, Vandewalle J (2003) Hardware architectures for public key cryptography. Integr VLSI J 34(1):1–64
Diffie W, Hellman ME (1976) New directions in cryptography. IEEE Trans Inf Theory 22(6):644–654
ElGamal T (1984) A public key cryptosystem and a signature scheme based on discrete logarithms. In: Advances in cryptology. Springer, pp 10–18
Koç ÇK (1995) Analysis of sliding window techniques for exponentiation. Comput Math Appl 30(10):17–24
Montgomery PL (1985) Modular multiplication without trial division. Math Comput 44(170):519–521
Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120–126
Stallings W (2003) Network security essentials: applications and standards, 4/e. Pearson Education India
Vollala S, Ramasubramanian N (2017) Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques. Inf Process Lett 119:25–38
Vollala S, Geetha K, Ramasubramanian N (2016) Efficient modular exponential algorithms compatible with hardware implementation of public-key cryptography. Sec Commun Netw 9(16):3105–3115
Vollala S, Tiwari U, Amin R (2019) A metric reckon algorithm for bit forwarding techniques. In: 2019 IEEE international symposium on smart electronic systems (iSES)(Formerly iNiS). IEEE, pp 21–24
Vollala S, Varadhan V, Geetha K, Ramasubramanian N (2014) Efficient modular multiplication algorithms for public key cryptography. In: 2014 IEEE international advance computing conference (IACC). IEEE, pp 74–78
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Vollala, S., Ramasubramanian, N., Tiwari, U. (2021). Bit Forwarding Techniques for Efficient Modular Exponentiation. In: Energy-Efficient Modular Exponential Techniques for Public-Key Cryptography. Springer, Cham. https://doi.org/10.1007/978-3-030-74524-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-74524-0_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-74523-3
Online ISBN: 978-3-030-74524-0
eBook Packages: Computer ScienceComputer Science (R0)