Paper 2012/170 Original: eprint.iacr.org/2012/170 ↗

Approaches for the performance increasing of software implementation of integer multiplication in prime fields

Vladislav Kovtun
Andrew Okhrimenko
Abstract

Authors have proposed the approach to increase performance of software implementation of finite field multiplication algorithm, for 32-bit and 64-bit platforms. The approach is based on delayed carry mechanism of significant bit in sum accumulating. This allows to avoid the requirement of taking into account the significant bit carry at the each iteration of the sum accumulation loop. The delayed carry mechanism reduces the total number of additions and gives the opportunity to apply the modern parallelization technologies.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint.
History
2012-03-31: last updated
2012-03-31: published
Short URL
https://ia.cr/2012/170
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2012/170,
      author = {Vladislav Kovtun and Andrew Okhrimenko},
      title = {Approaches for the performance increasing of software implementation of integer multiplication in prime fields},
      howpublished = {Cryptology {ePrint} Archive, Paper 2012/170},
      year = {2012},
      url = {https://eprint.iacr.org/2012/170}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.