Öz
-
Anahtar Kelimeler
Kaynakça
- Stinson, D.R., Cryptography theory and practice, CRC Press LLC, USA (1995).
- McEliece, R.J., A public-key cryptosystem based on algebraic coding theory, DSN Progress Report 42- 44, 114-116 (1978).
- Golay, M.J.E., Notes on digital coding, Proc. I.R.E., 37, 657 (1949).
- Roman, Coding and Information Theory, Graduate Text in Mathematics, Springer Verlag (1992).
- Sapna, J., Campopiano-type bounds in non- Hamming array coding, Linear Algebra and its Applications, 420, 135-159 (2007).
- Pless, V.S., Hufmann, W.C., Handbook of coding theory, Elsevier B.V., The Netherlands (1998).
- Şiap, V., Matris Kodlar ile McEliece Şifreleme Sistemi, Yüksek Lisans, Sakarya Üniversitesi, 55- 73 (2008).
- Rao, T.R.N., Nam, K.H., Private-key algebraic- code encryptions, IEEE Trans on Inform Theory, 35 (1989).
Öz
Public-key cryptosystems form an important part of cryptography. In these systems, every user has a public and a private key. The public key allows other users to encrypt messages, which can only be decoded using the secret private key. In that way, public-key cryptosystems allow easy and secure communication between all users without the need to actually meet and exchange keys. One such system is the McEliece Public-Key cryptosystem, sometimes also called McEliece Scheme. However, as we live in the information age, coding is used in order to protecet or correct the messages in the transferring or the storing processes. So, linear codes are important in the transferring or the storing. Due to richness of their structure array codes which are linear are also an important codes. However, the information is then transferred into the source more securely by increasing the error correction capability with array codes. In this paper, we combine two interesting topics, McEliece cryptosystem and array codes.
Anahtar Kelimeler
Kaynakça
- Stinson, D.R., Cryptography theory and practice, CRC Press LLC, USA (1995).
- McEliece, R.J., A public-key cryptosystem based on algebraic coding theory, DSN Progress Report 42- 44, 114-116 (1978).
- Golay, M.J.E., Notes on digital coding, Proc. I.R.E., 37, 657 (1949).
- Roman, Coding and Information Theory, Graduate Text in Mathematics, Springer Verlag (1992).
- Sapna, J., Campopiano-type bounds in non- Hamming array coding, Linear Algebra and its Applications, 420, 135-159 (2007).
- Pless, V.S., Hufmann, W.C., Handbook of coding theory, Elsevier B.V., The Netherlands (1998).
- Şiap, V., Matris Kodlar ile McEliece Şifreleme Sistemi, Yüksek Lisans, Sakarya Üniversitesi, 55- 73 (2008).
- Rao, T.R.N., Nam, K.H., Private-key algebraic- code encryptions, IEEE Trans on Inform Theory, 35 (1989).
Ayrıntılar
| Birincil Dil | Türkçe |
|---|---|
| Konular | Mühendislik |
| Bölüm | Araştırma Makalesi |
| Yazarlar | |
| Yayımlanma Tarihi | 1 Aralık 2011 |
| Gönderilme Tarihi | 14 Mart 2014 |
| Yayımlandığı Sayı | Yıl 2011 Cilt: 15 Sayı: 2 |
Kaynak Göster
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.