skip to main content

Learning With Error for Digital Image Encryption

*Aisyah Nooravieta Setiawan  -  Departement of Mathematics, Universitas Gadjah Mada, Yogyakarta, Indonesia
Indah Emilia Wijayanti  -  Departement of Mathematics, Universitas Gadjah Mada, Yogyakarta, Indonesia
Uha Isnaini  -  Departement of Mathematics, Universitas Gadjah Mada, Yogyakarta, Indonesia

Citation Format:
Abstract
Learning With Error (LWE) is one of the development of a system linear equation that add some noise or error. These problems have good potential for cryptography, especially for the development of Key Exchange Mechanism (KEM). Moreover, the question is whether LWE can be applied for digital image security or not. The digital image consists of hundreds of pixels that can be interpreted as a matrix. Each Pixel is encrypted with LWE so that the image becomes unidentified or cipher.
Fulltext
Keywords: Learning With Error, Cryptography, Digital Image, Encryption, Decryp- tion.

Article Metrics:

  1. Ajtai, M., 1996,”Generating hard instances of lattice problems”, Quaderni di Matematica,
  2. :1–32
  3. Davidowitz, N.S., 2018, ”Ring-SIS and Ideal Lattices”, www.noahsd.com, Diakses pada
  4. tanggal 3 Mei 2023
  5. Gonzalez, R. C., and Woods, R. E., 2018, Digital Image Processing, Fourth Edition, Pear-
  6. son, New York
  7. Marleny, F. D., 2021, Pengolahan Citra Digital Menggunakan Python, Vol. 1, CV. Pena
  8. Persada
  9. Macciancio, D., Goldwasser, S., 2002, Complexity Of Lattice Problems A Cryptographic
  10. Prespective, Springer Science Business Media, New York
  11. National Institute of Standards and Technology Interagency, 2022, ”Status Report on the
  12. Third Round of the NIST Post-Quantum Cryptography Standardization Process”, FIPS
  13. National Institute of Standards and Technology Interagency, 2023, Module-Lattice-based
  14. Key-Encapsulation Mechanism Standard, FIPS 203
  15. Peikert, C., 2016, ”A Decade of Lattice Cryptography”, Lattice Survey, Supported by the
  16. National Science Foundation under CAREER Award CCF-1054495, by DARPA under
  17. agreement number FA8750-11- C-0096, and by the Alfred P. Sloan Foundation
  18. Regev, O., 2005, ”On lattices, learning with errors, random linear codes, and crypto-
  19. graph”, J. ACM, 56(6):1–40
  20. Stinson, R.D., 2006, Cryptography Theory And Practice, Third Edition, CRC Press

Last update:

No citation recorded.

Last update:

No citation recorded.