Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Efficient Root Finding of Polynomials over Fields of Characteristic 2.

Abstract : 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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00626997
Contributor : Vincent Herbert <>
Submitted on : Tuesday, September 27, 2011 - 5:00:08 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Wednesday, December 28, 2011 - 2:48:51 AM

Files

tbz.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00626997, version 1

Collections

Citation

Bhaskar Biswas, Vincent Herbert. Efficient Root Finding of Polynomials over Fields of Characteristic 2.. 2009. ⟨hal-00626997⟩

Share

Metrics

Record views

440

Files downloads

2017