Dobór bezpiecznej kryptograficznie długości klucza publicznego dla systemów opartych na teorii kodowania na przykładzie systemu McEliece’a

• Autorzy: Janoska Artur

Identyfikatory

DOI

10.15199/59.2020.11–12.4

Warianty tytułu

EN

Selection of cryptographically secure public key length for systems based on the coding theory on example of the McEliece system

• Języki publikacji: PL

Abstrakty

PL

Pokazano metodę oszacowania bezpiecznej długości klucza publicznego dla systemów szyfrowych z kluczem publicznym opartych na teorii kodowania na przykładzie systemu McEliece’a.

EN

We show in the paper a method for estimating secure length of the public key in cryptosystems based on codes like to McEliece cryptosystem.

Słowa kluczowe

PL

system McEliece’a; kody Goppy; kody MDPC

EN

McEliece systems; Goppa code; MDPC code

• Wydawca: Wydawnictwo SIGMA-NOT
• Czasopismo: Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne
• Rocznik: 2020
• Tom: nr 11-12
• Strony: 439--445
• Opis fizyczny: Bibliogr. 25 poz., rys.

Twórcy

autor

Janoska Artur

• Wojskowa Akademia Techniczna im. Jarosława Dąbrowskiego

Bibliografia

• [1] Diffie W. i M. Hellman ,„New directions in cryptograph,” IEEE Transactions on Information Theory, tom 22, nr 6, pp. 644-654, 1976.
• [2] Rivest R. L., A. Shamiri L. Adleman, „A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, tom 21, nr 2, pp. 120-126, 1978.
• [3] ElGamal T., „A public key cryptosystem and asignature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, tom 31, nr 4, pp. 469-472, 1985.
• [4] Koblitz N. ,„Elliptic curve cryptosystems,” Mathematics of computation, tom 48, nr 177, pp. 203-209, 1987.
• [5] Shor P. W., „Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM review, tom 41, nr 2, pp. 303-332, 1999.
• [6] McEliece R. J., „A public-key cryptosystem based on algebraic,” Coding Thv, tom 4244, pp. 114-116, 1978.
• [7] Niederreiter H. ,„Knapsack-type cryptosystems and algebraic coding theory,” Problems of control and information theory-problemy upravleniya i teorii informatsii, tom 15, nr 2, pp. 159--166, 1986.
• [8] Pilitowska A. ,Algebraiczne aspekty teorii kodów, Politechnika Warszawska, 2008.
• [9] Jochemsz E. ,Goppa Codes & the McEliece Cryptosystem, Doktorarbeit, Universiteit van Amsterdam, 2002.
• [10] Loidreau P. a. S. N., „Weak keys in the McEliece public-key cryptosystem,” IEEE Transactions on Information Theory, tom 47, nr 3, pp. 1207-1211, 2001.
• [11] Lee P. J. a. B. E. F., „An observation on the security of McEliece’s public-key cryptosystem,” w Workshop on the Theory and Application of of Cryptographic Techniques, Springer, 1988, pp. 275-280.
• [12] Becker A., A. Joux, A. May i A. Maurer, Decoding random binary linear codes in 2n/20: How 1+ 1= 0 improves information set decoding.
• [13] Torres R. C., N. Sendrier, „Analysis of information set decoding for a sub-linear error weight,” w International Workshop on Post-Quantum Cryptography, Springer, 2016, pp. 144-161.
• [14] Stern J., „A method for finding codewords of small weight,” w International Colloquium on Coding Theory and Applications, Springer, 1988, pp. 106-113.
• [15] May A., X. Meurer i E. Aleand Thomae, „Decoding Random Linear Codes in O(2^{ 0.054 n}),” w International Conference on the Theory and Application of Cryptology and Information Security, Springer, 2011, pp. 107-124.
• [16] Prange E., „The use of information sets in decoding cyclic codes,” w IRE Transactions on Information Theory, IEEE, 1962, pp. 5-9.
• [17] Dumer I., „On minimum distance decoding of linear codes,” w Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory, 1991, pp. 50-52.
• [18] May A. i I. Ozerov, „On computing nearest neighbors with applications to decoding of binary linear codes,” w Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, 2015, pp. 203-228.
• [19] Sendrier N., „Decoding one out of many,” w International Workshop on Post-Quantum Cryptography, Springer, 2011, pp. 51-67.
• [20] Kobara K. i H. Imai, „Semantically secure McEliece public-key cryptosystems - conversions for McEliece PKC,” w International Workshop on Public Key Cryptography, Springer, 2001, pp. 19-35.
• [21] Faugere J.-C. a. G.-U. V., A. Otmani, L. Perret i J.-P. Tillich, „A distinguisher for high-rate McEliece cryptosystems,” IEEE Transactions on Information Theory, tom 59, nr 10, pp. 6830-6844, 2013.
• [22] Misoczki R., P. S. Barreto, „Compact McEliece keys from Goppa codes,” w International Workshop on Selected Areas in Cryptography, Springer, 2009, pp. 376-392.
• [23] Persichetti E., Compact McEliece keys based on quasi-dyadic Srivastava codes, Walter de Gruyter GmbH & Co. KG, 2012.
• [24] Baldi M., F. Chiaraluce, R. Garello, „On the usage of quasi-cyclic low-density parity-check codes in the McEliece cryptosystem,” w Communications and Electronics, 2006. ICCE'06. First International Conference on, IEEE, 2006, pp. 305-310.
• [25] Misoczki R., J.-P. Tillich, N. Sendrier, P. S. Barreto, „MDPC-McEliece: New McEliece variants from moderate density parity-check codes,” w Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on, IEEE, 2013, pp. 2069-2073.

Uwagi

PL

Opracowanie rekordu ze środków MNiSW, umowa Nr 461252 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2021).