Implementation of Cryptographic Primitives

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
© 2017 by IJETT Journal
Volume-49 Number-4
Year of Publication : 2017
Authors : Shreya Rajkumar, Dr. Chester Rebeiro
DOI :  10.14445/22315381/IJETT-V49P240


Shreya Rajkumar, Dr. Chester Rebeiro "Implementation of Cryptographic Primitives", International Journal of Engineering Trends and Technology (IJETT), V49(4),264-266 July 2017. ISSN:2231-5381. published by seventh sense research group

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.


[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)

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