Efficient Checkers for Number-Theoretic Computations

Blum has recently proposed a new approach to the problem of program correctness, the program checker. Here, efficient program checkers are presented for two important number theory problems, integer GCD and modular exponentiation. The former result answers an open problem posed by Blum. The latter r...

Full description

Saved in:
Bibliographic Details
Published in:Information and computation 1995-08, Vol.121 (1), p.93-102
Main Authors: Adleman, L.M., Huang, M.D., Kompella, K.
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Programming theory
Theoretical computing
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Blum has recently proposed a new approach to the problem of program correctness, the program checker. Here, efficient program checkers are presented for two important number theory problems, integer GCD and modular exponentiation. The former result answers an open problem posed by Blum. The latter result paves the way for more robust cryptographic programs, as modular exponentiation is the basis for several cryptosystems. Taken together, these results lay the foundation for more reliable number-theoretic programs.
ISSN:0890-5401
1090-2651
DOI:10.1006/inco.1995.1125