Efficient checkers for number-theoretic computations

DOI10.1006/inco.1995.1125zbMath0840.11053OpenAlexW1968223186MaRDI QIDQ1898116

Ming-Deh A. Huang, Leonard M. Adleman, Kireeti Kompella

Publication date: 1 July 1996

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1125

zbMATH Keywords

complexitygreatest common divisormodular exponentiationRSA cryptosystemprogram checkers

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Computational number theory (11Y99)

Related Items

Designing checkers for programs that run in parallel, Efficient and secure delegation of exponentiation in general groups to a single malicious server, ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM, A nonadaptive NC checker for permutation group intersection, Spot-checkers, Self-testing/correcting with applications to numerical problems