File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Testing of large number multiplication functions in cryptographic systems

TitleTesting of large number multiplication functions in cryptographic systems
Authors
Tse, THChen, TYZhou, Z
KeywordsCryptographic systems
large number multiplication
software testing
Issue Date2000
PublisherIEEE Computer Society.
Citation
The 1st Asia-Pacific Conference on Quality Software Proceedings, Hong Kong, China, 30-31 October 2000, p. 89-98 How to Cite?
DOI: http://dx.doi.org/10.1109/APAQ.2000.883782
AbstractInteger 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.
Persistent Identifierhttp://hdl.handle.net/10722/48438

 

DC FieldValueLanguage
dc.contributor.authorTse, THen_HK
dc.contributor.authorChen, TYen_HK
dc.contributor.authorZhou, Zen_HK
dc.date.accessioned2008-05-22T04:13:02Z-
dc.date.available2008-05-22T04:13:02Z-
dc.date.issued2000en_HK
dc.identifier.citationThe 1st Asia-Pacific Conference on Quality Software Proceedings, Hong Kong, China, 30-31 October 2000, p. 89-98en_HK
dc.identifier.urihttp://hdl.handle.net/10722/48438-
dc.description.abstractInteger 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.en_HK
dc.format.extent684697 bytes-
dc.format.extent783 bytes-
dc.format.extent783 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE Computer Society.en_HK
dc.relation.ispartofAsia-Pacific Conference on Quality Software Proceedings-
dc.rights©2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectCryptographic systemsen_HK
dc.subjectlarge number multiplicationen_HK
dc.subjectsoftware testingen_HK
dc.titleTesting of large number multiplication functions in cryptographic systemsen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailTse, TH: thtse@cs.hku.hken_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/APAQ.2000.883782en_HK
dc.identifier.scopuseid_2-s2.0-79551562306-
dc.identifier.hkuros56493-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats