CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Development of a Lattice-based Cryptosystem

by S. I. Anyanwu, B. K. Alese, O. O. Obe
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 81 - Number 9
Year of Publication: 2013
Authors: S. I. Anyanwu, B. K. Alese, O. O. Obe
10.5120/14038-9131

S. I. Anyanwu, B. K. Alese, O. O. Obe . Development of a Lattice-based Cryptosystem. International Journal of Computer Applications. 81, 9 ( November 2013), 11-14. DOI=10.5120/14038-9131

@article{ 10.5120/14038-9131,
author = { S. I. Anyanwu, B. K. Alese, O. O. Obe },
title = { Development of a Lattice-based Cryptosystem },
journal = { International Journal of Computer Applications },
issue_date = { November 2013 },
volume = { 81 },
number = { 9 },
month = { November },
year = { 2013 },
issn = { 0975-8887 },
pages = { 11-14 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume81/number9/14038-9131/ },
doi = { 10.5120/14038-9131 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:55:36.426171+05:30
%A S. I. Anyanwu
%A B. K. Alese
%A O. O. Obe
%T Development of a Lattice-based Cryptosystem
%J International Journal of Computer Applications
%@ 0975-8887
%V 81
%N 9
%P 11-14
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This work proposes a lattice-based cryptosystem using embedded technique of the closest vector problem (CVP). It adopts the key-gen algorithms of [1], and improves on vector reduction method for encryption/decryption. With this we achieved great implementation speed and time for an acceptable security parameter.

References
  1. Plantard T. , Rose M. and Willy S. (2009). Improvement of Lattice-based Cryptography using CRT. School of Computer and Software Engineering, University of Wollongong NSW, Australia.
  2. Ajtai, M. (1996). Generating Hard Instances of Lattice Problems. In Proceedings of the 28th annual ACM Symposium on Theory of Computing, New York, USA.
  3. Alese, B. K. (2000). Vulnerability Analysis of Encryption/Decryption Techniques of Computer Network Security. Master's Thesis, Department of Computer Science, Federal University of Technology, Akure, Nigeria.
  4. Edward, P. (2011). Comparative Analysis of Public-Key Encryption Schemes. Master's Thesis, Department of Computer Science, Federal University of Technology, Akure, Nigeria.
  5. Diffie and Hellman (1976). New Directions in Cryptography. IEEE Transactions on Information Theory, Vol. IT-22, pp 644 – 654.
  6. Barreno, M. A. (2002). The Future of Cryptography Under Quantum Computers. Department of Computer Science. Dartmouth College. Technical Report TR'02 – 425.
  7. Micciancio, D. (2003). Lattice-Based Cryptography. University of California, San Diego.
  8. Micciancio, D. and O. Regev (2008). Lattice-Based Cryptography. In Proceedings of Crypto 2009, pages 577 – 594, Springer.
  9. Ruckert, M. and M. Schneider (2010). Estimating the Security of Lattice-Based Cryptosystems. Technischen Universitat Darmstadt, Department of Computer Science, Cryptography and Computer algebra, Germany.
  10. Cai J. and H. Zhu (2005). Progress in Computational Complexity Theory: Lattice Problems. In Journal of Computer Science and Technology, Vol. 20, No. 6, pages 735 – 750, Springer.
  11. Peikert, C. (2009). Some Recent Progress in Lattice-Based Cryptography. TCC'09 (ppt).
  12. Galbraith S. (2011). Mathematics of Public Key Cryptography. Department of Math, University of AucMand, New Zealand. http://www. isg. rhul. ac. uk/sdg/crypto-book
Index Terms

Computer Science
Information Sciences

Keywords

Lattice-based Cryptography Quantum Cryptography Closest Vector Problem Lattices Quantum.

Powered by PhDFocusTM