Penerapan Kode Golay Diperpanjang pada Kriptosistem McEliece

 (*)Ilham Setyawan Mail (Universitas Sebelas Maret, Surakarta, Indonesia)
 Putranto Hadi Utomo (Universitas Sebelas Maret, Surakarta, Indonesia)

(*) Corresponding Author


In this modern era, quantum computers appear that can calculate mathematical operations faster than classical computers. Some cryptosystems can be solved with the computer, but there are cryptosystems that have not been solved using the computer, one of which is the McEliece cryptosystem. The McEliece cryptosystem uses error correction codes so that it is more secure than cryptosystems that use factorization. The basic idea of this cryptosystem is that someone can give an error message so that the message cannot be read by an attacker. Golay code is a code with a length of 24-bits that can correct errors up to 3 bit errors. This article describes the implementation of Golay code on the McEliece cryptosystem.


Cryptography, Quantum Computers, McEliece Cryptosystem;Error-Correction Code;Golay Code

Full Text:


Article Metrics

Abstract view : 470 times
PDF - 320 times


M. C. Sinaga, "Kriptografi Python," INA-Rxiv, 2017.

D. J. Bernstein, "Introduction to post-quantum cryptography," in Post-quantum cryptography, 2009.

L. Chen et al., "Report on post-quantum cryptography," National Institute of Standard and Technology, US, 2016.

W. Diffie and M. Hellman, "New directions in cryptography," IEEE transactions on Information Theory, 1976.

R. L. Rivest, L. Adleman, and M. L. Dertouzos, "On data banks and privacy homomorphisms," Foundations of secure computation, 1978.

R. L. Rivest, A. Shamir, and L. Adleman, " A method for obtaining digital signatures and public-key cryptosystems," Communications of the ACM, 1978.

J. Buchmann and H. C. Williams, "A key-exchange system based on imaginary quadratic fields," Journal of Cryptology, 1988.

N. Koblitz, "Elliptic curve cryptosystems," Mathematics of computation, 1987.

J. Hoffstein, J. Pipher, and J. H. Silverman, "ntru: A ring-based public key cryptosystem," in International Algorithmic Number Theory Symposium: Springer, 1998.

R. J. McEliece, "A public-key cryptosystem based on algebraic coding theory," JPL DSN Progress Report, 1978.

J.-Y. Cai and T. W. Cusick, " A lattice-based public-key cryptosystem," in International Workshop on Selected Areas in Cryptography: Springer, 1998.

M. J. E. Golay, "Notes on digital coding," Proc. IRE, p. 67, 1949.

S. B. Wicker, Error Control Systems for Digital Communication and Storage. Prentice Hall, 1995.

M. Elia, "Algebraic decoding of the (23, 12, 7) Golay codes," y, IEEE transactions on Information Theory, vol. 33, pp. 150-151, 1987.

I. S. Reed, X. Yin, T. K. Truong, and J. K. Holmes, "Decoding the (24,12,8) Golay code," IEE Processings, vol. 137, pp. 202-206, 1990.

Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Penerapan Kode Golay Diperpanjang pada Kriptosistem McEliece


  • There are currently no refbacks.

Copyright (c) 2022 Ilham Setyawan, Putranto Hadi Utomo

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer)
P3M STMIK Budi Darma
Sekretariat Jln. Sisingamangaraja No. 338 Telp 061-7875998

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.