Paper 2014/561

Performance Increasing Approaches For Binary Field Inversion

Vladislav Kovtun and Maria Bulakh

Abstract

Authors propose several approaches for increasing performance of multiplicative inversion algorithm in binary fields based on Extended Euclidean Algorithm (EEA). First approach is based on Extended Euclidean Algorithm specificity: either invariant polynomial u remains intact or swaps with invariant polynomial v. It makes it possible to avoid necessity of polynomial v degree computing. The second approach is based on searching the "next matching index" when calculating the degree of the polynomial, since degree polynomial invariant u at least decreases by 1, then it is possible to use current value while further calculation the degree of the polynomial.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint. MAJOR revision.
Keywords
binary fieldmultiplicative inversionExtended Euclidean Algorithm
Contact author(s)
vladislav kovtun @ gmail com
History
2014-07-18: revised
2014-07-18: received
See all versions
Short URL
https://ia.cr/2014/561
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/561,
      author = {Vladislav Kovtun and Maria Bulakh},
      title = {Performance Increasing Approaches For Binary Field Inversion},
      howpublished = {Cryptology ePrint Archive, Paper 2014/561},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/561}},
      url = {https://eprint.iacr.org/2014/561}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.