Challenges in data representation for efficient execution of encryption operation

Big number operation has always been a bottleneck to computer system as it imposes high demand on computing power. With a limited power available, operations such as exponentiation and multiplication involving large integer belonging to encryption process requires grave scrutiny. One way to address this issue is by replacing an original complex computation into a sequence of small computations that in the end produces the same results. This paper takes an evolutionary approach to survey numerous articles that have contributed to the advancement of integer representation. Numerous representations were proposed, those that come into play concentrated on reducing non-zero digits and limiting non-zero spacing other than allowing subtraction operation. A comparison was made to distinguish the properties of each method from the others. This detailed outlook can be a guide for identifying the correct representation to be chosen for implementation within specific application.

Text Challenges_in_data_representation_for_efficient_ex.pdf Download (421kB) Official URL or Download Paper: https://beei.org/index.php/EEI/article/view/5437

Actions (login required)

View Item