Implementation of Cryptographic Primitives

Shreya Rajkumar; Dr. Chester Rebeiro

doi:https://doi.org/10.14445/22315381/IJETT-V49P240

Research Article | Open Access | Download PDF

Volume 49 | Number 2 | Year 2017 | Article Id. IJETT-V49P240 | DOI : https://doi.org/10.14445/22315381/IJETT-V49P240

Implementation of Cryptographic Primitives

Shreya Rajkumar, Dr. Chester Rebeiro

Citation :

Shreya Rajkumar, Dr. Chester Rebeiro, "Implementation of Cryptographic Primitives," International Journal of Engineering Trends and Technology (IJETT), vol. 49, no. 2, pp. 266-264, 2017. Crossref, https://doi.org/10.14445/22315381/IJETT-V49P240

Abstract

The efficiency of cryptographic library depends on the implementation of multi-precision algorithms. In this paper, implementation of algorithms for modular addition, subtraction, comparison, Extended GCD Algorithm, Montgomery multiplication, Montgomery Exponentiation is discussed and the developed library is tested for correctness and analyzed on various platforms. The developed library works for very large numbers .It is also scalable from 8 bit to 64 bit for a wide range of platforms that includes embedded controllers and DSP processors.

Keywords

Chinese Remainder Theorem (CRT), Cryptography, Functionality testing, Montgomery Multiplication, Montgomery Exponentiation, Multi-precision Library, RSA Algorithm.

References

[1] P. C. v. O. Alfred J. Menezes. Handbook of Applied Cryptography. CRC Press, August
[2] Koltuksuz A., H???l H. (2005) Crympix: Cryptographic Multiprecision Library. In: Yolum ., Güngör T., Gürgen F., Özturan C. (eds) Computer and Information Sciences - ISCIS 2005. ISCIS 2005. Lecture Notes in Computer Science, vol 3733. Springer, Berlin, Heidelberg.
[3] Koc, C.K.: High Speed RSA Implementation. RSA Laboratories. TR201 (1994)
[4] Bosselaers, A., Govaerts, R., Vandewalle, J.: A Fast and Flexible Software Library for Large Integer Arithmetic. In: Proceedings 15th Symposium on Information Theory in the Benelux, Louvain-la-Neuve (B), pp. 82–89 (1994)