Integer arithmetic with delayaed carry
DOI:
https://doi.org/10.18372/2410-7840.16.6932Keywords:
DCF representation, delayed carry, integers, integer arithmetic, software implementation, parallelizationAbstract
Cryptographic transformation with public key are widelyused in directional encryption, shared secret generationand digital signature. Therefore, performance improvingof cryptographic transformations with public key is actualproblem. Performance improving of operations on integersis a potential solution to this problem. Author proposeDCF representation of integers in which the numberis split into machine words, where each word has informationblock and carry block. Author propose algorithmsof basic arithmetic operations with delayed carry, providesrecommendations for effective software implementationof arithmetic operations (addition, subtraction).References
Умножения целых чисел с использованием отложеного переноса для криптосистем с открытым ключом / В.Ю.Ковтун, А.А.Охрименко [и др.] // Информационные технологи и системы в управлении, образовании, науке: Монография / Под ред. проф. В.С. Пономаренко. – Х.: Цифрова друкарня №1. – 2013. – С. 69-82.
Richard P. Brent and Paul Zimmermann. Modern Computer Arithmetic // Cambridge Monographs on Computational and Applied Mathematics (No. 18), Cambridge University Press, November 2010. 239 p.
Brumnik R., Kovtun V., Okhrimenko A. and Kavun S. Techniques For Performance Increasing Of Integer Multiplications In Cryptographic Application. – Mathematical Problems in Engineering. – vol. 2014. – 2014. – p.7. – doi:10.1155/2014/863617
Cohen H. and Frey G., editors. Handbook of Elliptic and Hyperelliptic Curve Cryptography. Discrete Mathematics and its Applications. – Chapman & Hall/CRC. – 2006. – p. 848.
Hankerson D., Menezes A., and Vanstone S.A. Guide to Elliptic Curve Cryptography, Springer- Verlag, – 2004. – p. 332.
Marc Joyel, Christophe Tymen. Compact Encoding of Non-Adjacent Forms with Applications to Elliptic Curve Cryptography // Published In K.Kim, Ed., Public Key Cryptography, vol. 1992 of LNCS, – Springer-Verlag. – 2001. – pp. 353-364.
Intel® 64 and IA-32 Architectures Optimization Reference Manual, available at: http://www.intel.com/content/www/us/en/architecture-andtechnology/64-ia-32-architectures-optimizationmanual.html (accessed 15 May 2014)
Knuth, Donald E. The Art of Computer Programming. Third edn. Vol.2 : Seminumerical Algorithms. - Addison-Wesley. – 1998. – 762p.
Patrick Longa, Ali Miri New Multibase Non- Adjacent Form Scalar Multiplication and its Application to Elliptic Curve Cryptosystems (extended version) // Cryptological ePrint Archive. – Report 2008/52. – 2008. – p.39. – URL: http://eprint.iacr.org/2008/052.pdf
Franco P. Preparata. On the Representation of Integers in Nonadjacent Form // SIAM Journal on Applied Mathematics. – Vol. 21. – No. 4. – 1971. – pp. 630-635.
Yanik T., Savas E., and Koc C. K. Incomplete Reduction in Modular Arithmetic. – IEEE Proceedings – Computers and Digital Techniques. – 149(2). – 2002. – pp. 46-52.
Downloads
Published
How to Cite
Issue
Section
License
The scientific journal adheres to the principles of Open Access and provides free, immediate, and permanent access to all published materials without financial, technical, or legal barriers for readers.
All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.
Copyright
Authors who publish their works in the journal:
-
retain the copyright to their publications;
-
grant the journal the right of first publication of the article;
-
agree to the distribution of their materials under the CC BY 4.0 license;
-
have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.
