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

Vladislav Kovtun; Andrew Okhrimenko

Paper 2012/170

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

Vladislav Kovtun and 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: Published elsewhere. Unknown where it was published
Keywords: integer multiplication software implementation elliptic curve cryptosystem cryptography finite field parallelism.
Contact author(s): vladislav kovtun @ gmail com
History: 2012-03-31: received
Short URL: https://ia.cr/2012/170
License: CC BY

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}
}