NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

PUBLICATIONS

A=B?

Published

Author(s)

Isabel M. Beichl, F Sullivan

Abstract

In this prescription we'll describe one technique for working with extremely large integers having perhaps thousands of digits, using only standard hardware and software. This technique uses modular arithmetic in a way that lets us recover the actual integers if necessary.
Citation
IEEE Computing in Science and Engineering
Volume
2
Issue
No. 3
Pub Type
Journals

Keywords

greatest common division, integer computation, modular arithmetic

Citation

Beichl, I. and Sullivan, F. (2000), A=B?, IEEE Computing in Science and Engineering (Accessed October 10, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created May 1, 2000, Updated February 17, 2017
Was this page helpful?