RANCANG BANGUN KRIPTANALISIS DENGAN BASIS GROEBNER PADA SISTEM KRIPTOGRAFI BERBASIS ALGORITMA HFE (Hidden Field Equation) MENGGUNAKAN ALGORITMA BUCHBERGER; AN IMPLEMENTATION OF GROEBNER BASE ON CRYPTANALISYS FOR CRYPTOSYSTEM WITH HFE (HIDDEN FIELDS EQUATION) ALGORITMS

EDI WINARKO, Retantyo Wardoyo

2014 | Disertasi | PROGRAM STUDI ILMU KOMPUTER

Testing the security of a cryptographic algorithm against cryptanalysis can be carried out using the crypto system to be tested. In this paper will be tested against HFE Asymmetric Algorithms. Let the public key of HFE Asymmetric Cryptography algorithm in the form of systems of polynomial equations n ? n ? p , p ,..., p K x , x ,..., x 1 2 1 2 ? over field K. Ideal n I p , p ,..., p 1 2 ? and the Lexicographic sort them ?? ? ? * ? * ? 2 2 * 1 1 , ,..., n n I p y p y p y where is { , * ,..., *} 2 * 1 n y y y a binary number of pieces of ciphertext block, will be searched by using Groebner Bases algorithm Buckberger. Furthermore Groebner Bases obtained will be reduced to a form that is simpler, thus facilitating the process of obtaining the solution of the polynomial equation system. The solution obtained will be converted back into text form which is a description of the ciphertext. In this thesis Matlab 2009a will be used to find a solution polynomial equation systems as asymmetric public key cryptography algorithm HFE.

Kata Kunci : Groebner Bases, Algoritms, HFE