Proceedings of the 1st Asia-Pacific Conference on Quality Software (APAQS '00),
IEEE Computer Society, Los Alamitos, CA, pp. 89-98 (2000)

Testing of Large Number Multiplication Functions
in Cryptographic Systems

T.H. Tse 2 , T.Y. Chen 3 , and Zhi Quan Zhou 4

[paper from IEEE Xplore | paper from IEEE digital library | postprint]


Integer multiplication is one of the fundamental functions in cryptographic systems. Although much research has already been done on the testing of multiplication functions, most does not meet the need of cryptographic systems, where very large numbers are involved. Others provide only probabilistic algorithms. In this paper, we propose an efficient deterministic algorithm for verifying large number multiplications in cryptographic systems. A deterministic oracle for large integer multiplication functions will result. In addition, our method can also be used to verify selected segments of digits in the product of two numbers.

Keywords: Cryptographic systems, large number multiplication, software testing

1. This research is supported in part by a grant of the Research Grants Council of Hong Kong and a research and conference grant of The University of Hong Kong.
2. (Corresponding author.)
Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong.
3. Centre for Software Analysis and Testing, Swinburne University of Technology, Hawthorn 3122, Australia. (Part of the work was carried out when Chen was with the Vocational Training Council, Hong Kong.)
4. Department of Computer Science, The University of Hong Kong


  Cumulative visitor count