Approaches to performance increasing of extended Euclidean algorithm for double precision division on single precision large integers. (English)

Public key cryptography has significant processing and spatial complexity. In this regard, relevant scientific and technical challenge is to improve the performance of such transformations. In this paper proposed approaches of large integer's division operation with double precision on single precision based on the Extended Euclidean Algorithm. These approaches include handling non-zero machine words in the most frequently used operations; using an semi-exact comparison of large integer, without for-word comparison; knowledge of the of Bézout equation parameters changing. These approaches are implemented in the modified algorithm, which has been software implemented. In experiments were compared numbers with double binary size dividend and single binary size divider with ratios for various filled and total binary length. Modified algorithm showed higher performance in 1.5-3 times, with dividend and divisor increasing binary length. [ABSTRACT FROM AUTHOR]

Copyright of Ukrainian Scientific Journal of Information Security is the property of National Aviation University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)