The Laws of Cryptography:
Compare Multiplication Results

by Neal R. Wagner

Copyright © 2001 by Neal R. Wagner. All rights reserved.

NOTE: This site is obsolete. See book draft (in PDF):

There have been two algorithms for multiplying field elements, a slow one and a fast one. As a check, the following program compares the results of all 65536 possible products to see that the two methods agree (which they do):


Revision date: 2001-12-28. (Please use ISO 8601, the International Standard.)