Efficient Root Finding of Polynomials over Fields of Characteristic 2.
Résumé
Root finding is the most time-consuming stage of McEliece cryptosystem decryption. The best method to find the zeroes of a polynomial for cryptographic parameters is the Berlekamp Trace Algorithm (BTA). Our idea is to mix BTA with ad-hoc methods proposed by Zinoviev. We obtain a significant gain in terms of time complexity for finding roots and so we decrease McEliece decryption time. This paper contains both theoretical and experimental study of this technique.
Fichier principal
tbz.pdf (176.4 Ko)
Télécharger le fichier
beamer.pdf (168.06 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Format : Autre