The Community for Technology Leaders
RSS Icon
Subscribe
Hong Kong, China
Oct. 30, 2000 to Oct. 31, 2000
ISBN: 0-7695-0825-1
pp: 89
T.H. Tse , University of Hong Kong
Zhiquan Zhou , University of Hong Kong
T.Y. Chen , Swinburne University of Technology
ABSTRACT
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.
INDEX TERMS
Cryptographic systems, large number multiplication, software testing
CITATION
T.H. Tse, Zhiquan Zhou, T.Y. Chen, "Testing of Large Number Multiplication Functions in Cryptographic Systems", APAQS, 2000, Asia-Pacific Conference on Quality Software, Asia-Pacific Conference on Quality Software 2000, pp. 89, doi:10.1109/APAQ.2000.883782
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool