A Public Key Cryptosystem Using Cyclotomic Matrices-Reference-Cited by-同舟云学术

A Public Key Cryptosystem Using Cyclotomic Matrices

Published:2021-11-23 Issue: Volume: Page:
ISSN:
Container-title:Coding Theory - Recent Advances, New Perspectives and Applications [Working Title]
language:
Short-container-title:

Author:

Helal Ahmed Md.,Tanti Jagmohan,Pushp Sumant

Abstract

Confidentiality and Integrity are two paramount objectives in the evaluation of information and communication technology. In this chapter, we propose an arithmetic approach for designing asymmetric key cryptography. Our method is based on the formulation of cyclotomic matrices correspond to a diophantine system. The strategy uses in cyclotomic matrices to design a one-way function. The result of a one-way function that is efficient to compute, however, is hard to process its inverse except if privileged information about the hidden entry is known. Also, we demonstrate that encryption and decryption can be efficiently performed with the asymptotic complexity of Oe2.373. Finally, we study the computational complexity of the cryptosystem.

Publisher

IntechOpen

Link

http://www.intechopen.com/download/pdf/79416

Reference44 articles.

1. Diffie, W., Hellman, M.: New directions in cryptography. IEEE transactions on Information Theory 22(6), 644–654 (1976)

2. Miller, V.S.: Use of elliptic curves in cryptography. In: Conference on the theory and application of cryptographic techniques, pp. 417–426. Springer (1985)

3. Wiener, M.J., Zuccherato, R.J.: Faster attacks on elliptic curve cryptosystems. In: International workshop on selected areas in cryptography, pp. 190–200. Springer (1998)

4. Ahmad, J.I., Din, R., Ahmad, M. Analysis review on public key cryptography algorithms. International Journal of Electrical and Computer Engineering (IJECE) 12(2), 447–454 (2018)

5. Korzhik, V.I., Turkin, A.I.: Cryptanalysis of mcelieces public-key cryptosystem. In: Workshop on the Theory and Application of of Cryptographic Techniques, pp. 68–70. Springer (1991)