A Binary Arithmetic for the Fermat Number Transform,

Abstract

The number theoretic transform (NTT) and the use of moduli of the form of the tth Fermat number (F sub t) = (2 sup b) + 1, b = (2 sup t), are reviewed. A binary arithmetic that permits the exact computation of the Fermat number transform (FNT) is described. This technique involves arithmetic in a binary code corresponding to the simplest one of a set of code translations from the normal binary representation of each integer in the ring of integers modulo (F sub t).

Document Details

Document Type
Technical Report
Publication Date
Mar 18, 1976
Accession Number
ADA023061

Entities

People

  • Lawrence M. Leibowitz

Organizations

  • United States Naval Research Laboratory

Tags

DTIC Thesaurus Topics

  • Arithmetic
  • Binary Arithmetic
  • Computations
  • Mathematics
  • Numbers

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Approximation Theory.
  • Wave Propagation and Nonlinear Chaotic Dynamics.