ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
The Use of Index Calculus and Mersenne Primes for the Design of a High-Speed Digital Multiplier
Full text PdfPdf (478 KB)
Source Journal of the ACM (JACM) archive
Volume 8 ,  Issue 1  (January 1961) table of contents
Pages: 87 - 96  
Year of Publication: 1961
ISSN:0004-5411
Author
Aviezri S. Fraenkel  University of California, Los Angeles
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 20,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321052.321057
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
SVOBODA, A. Rational numerical system of residual classes. Stroje Na Zpracovani Informaci (Czechoslovakia) 5 (1957), 9-47.
 
2
GARNEIt, H. L. The residue number system. IRE Trans. Electronic Computers 8 (1959), 140-147.
 
3
BIRKtlOFF, G., AND MAC LANE S., A Survey of Modern Algebra. Macmillan, 1957.
 
4
DICKSON, L. E., History of the Theory of Numbers, Vol. 1. Chelsea, 1952.
 
5
JACOBSON, N., Lectures in Abstract Algebra, Vol. 1. D. Van Nostrand, 1958.
 
6
ROBINSON, R. M., Mersenne and Fermat numbers. Proc. Math. Soc. 5 (1954), 842-846.
 
7
RIESEL, H., Mersenne numbers. Math. Tables Aids Comput. 12 (1958), 207-213.
 
8
ESTRIN, G., Organization of computer systems--The fixed plus variable structure computer. Western Joint Computer Conference, May 3, 1960, San Francisco, California.
 
9
DIRICHLET, P. G. LEJEUNE, Vorlesungen uber Zahlentheorie. Braunsehweig, 1894.

CITED BY
E. Horowitz, Modular arithmetic and finite field theory: A tutorial, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.188-194, March 23-25, 1971, Los Angeles, California, United States

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.0 General
          Subjects: Computer arithmetic

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.1 Numerical Algorithms and Problems
          Subjects: Number-theoretic computations (e.g., factoring, primality testing)


General Terms:
Measurement, Performance, Theory, Verification

Collaborative Colleagues:
Aviezri S. Fraenkel: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player