Algorithms for Super Long Integers in Cryptosystems  

作　　者：SU Shenghui LI Jian LUE Shuwang 

机构地区：[1]College of Computer, Beijing University of Technology, Beijing 100124, China [2]College of Information Engineering, Yangzhou University, Yangzhou 225009, China [3]Graduate School, Chinese Academy of Sciences, Beijing 100039, China

出　　处：《Chinese Journal of Electronics》2013年第2期258-262,共5页电子学报（英文版）

摘　　要：Super long integers which exceed the limit of numbers defined in existent computers are widely em- ployed in cryptosystems. In the paper, design 10 algo- rithms which address operands by the byte, and are used for the operation of unsigned super long integers, includ- ing conversion between a binary number and a decimal one, shift, comparison, addition, subtraction, multiplication, di- vision, and modular power, analyze the time complexity of each of the algorithms in the amount of bit operations, offer the source code of the modular power operation in C, and give some examples which are utilized for validating the correctness of the algorithms according to the properties of a group.

关 键 词：CRYPTOSYSTEM Super long integer Algo- rithm Time complexity Validation. 

分 类 号：TP273[自动化与计算机技术—检测技术与自动化装置] TP311.1[自动化与计算机技术—控制科学与工程]