Techniques for Performance Improvement of Integer Multiplication in Cryptographic Applications
The problem of arithmetic operations performance in number fields is actively researched by many scientists, as evidenced by significant publications in this field. In this work, we offer some techniques to increase performance of software implementation of finite field multiplication algorithm, for...
Main Authors: | Robert Brumnik, Vladislav Kovtun, Andrew Okhrimenko, Sergii Kavun |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2014/863617 |
Similar Items
-
Efficient Big Integer Multiplication and Squaring Algorithms for Cryptographic Applications
by: Shahram Jahani, et al.
Published: (2014-01-01) -
Efficient Big Integer Multiplication and Squaring Algorithms for Cryptographic Applications
by: Jahani, Shahram, et al.
Published: (2014) -
Efficient Integer Representations for Cryptographic Operations
by: Muir, James
Published: (2006) -
Efficient Integer Representations for Cryptographic Operations
by: Muir, James
Published: (2006) -
Simulation of Territorial Development Based on Fiscal Policy Tools
by: Robert Brumnik, et al.
Published: (2014-01-01)