Skip to main navigation Skip to search Skip to main content

Testing of large number multiplication functions in cryptographic systems

  • T. H. Tse*
  • , T. Y. Chen
  • , Zhiquan Zhou
  • *Corresponding author for this work

Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProceedings - 1st Asia-Pacific Conference on Quality Software, APAQS 2000
EditorsT.H. Tse, T.Y. Chen
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages89-98
Number of pages10
ISBN (Electronic)0769508251, 9780769508252
DOIs
Publication statusPublished - 2000
Externally publishedYes
Event1st Asia-Pacific Conference on Quality Software, APAQS 2000 - Hong Kong, China
Duration: 30 Oct 200031 Oct 2000

Publication series

NameProceedings - 1st Asia-Pacific Conference on Quality Software, APAQS 2000

Conference

Conference1st Asia-Pacific Conference on Quality Software, APAQS 2000
Country/TerritoryChina
CityHong Kong
Period30/10/0031/10/00

Free Keywords

  • Cryptographic systems
  • large number multiplication
  • software testing

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science

Fingerprint

Dive into the research topics of 'Testing of large number multiplication functions in cryptographic systems'. Together they form a unique fingerprint.

Cite this