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
On the generation of multivariate polynomials which are hard to factor
Full text PdfPdf (770 KB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing table of contents
San Diego, California, United States
Pages: 796 - 804  
Year of Publication: 1993
ISBN:0-89791-591-7
Author
Adi Shamir
Sponsor
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 40,   Citation Count: 2
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/167088.167291
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
A. S. Fraenkel and Y. Yesha{1977}, "Complexity of Problems in Games, Graphs, and Algebraic Equations", unpublished manuscript.
 
2
K. Manders and L. Adleman{1978}, "NP- Complete Decision Problems for Binary Quadratics", J. Comput. System Sci. 16, 168-184.
 
3
Y. Matijasevic and J. Robinson{1975}, "Reduction of an arbitrary Diophantine Equation to One in 13 Unknowns", Acta Arith. 27, 521-553.
4
R. L. Rivest , A. Shamir , L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, v.21 n.2, p.120-126, Feb. 1978  [doi>10.1145/359340.359342]

CITED BY  2
Joachim von zur Gathen , Silke Hartlieb, Factoring modular polynomials (extended abstract), Proceedings of the 1996 international symposium on Symbolic and algebraic computation, p.10-17, July 24-26, 1996, Zurich, Switzerland
Howard Cheng , George Labahn, Computing all factorizations in ***, Proceedings of the 2001 international symposium on Symbolic and algebraic computation, p.64-71, July 2001, London, Ontario, Canada

INDEX TERMS

Primary 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)

Additional Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.5 Roots of Nonlinear Equations
          Subjects: Polynomials, methods for
  G.2 DISCRETE MATHEMATICS

  I. Computing Methodologies
  I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION
      I.1.2 Algorithms
          Subjects: Algebraic algorithms


General Terms:
Algorithms, Theory, Verification

Collaborative Colleagues:
Adi Shamir: 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