Author:
Bach Eric,von zur Gathen Joachim,Lenstra Hendrik W.
Subject
Applied Mathematics,General Engineering,Algebra and Number Theory,Theoretical Computer Science
Reference18 articles.
1. L. M. Adleman and H. W. Lenstra, Jr., Finding irreducible polynomials over finite fields, inProceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC), Berkeley, 1986, pp. 350–355.
2. The orders of the linear groups;Artin;Comm. Pure Appl. Math.,1955
3. Introduction to Commutative Algebra;Atiyah,1969
4. Factoring with cyclotomic polynomials;Bach;Math. Comput.,1989
5. Algorithmic Number Theory;Bach,1996
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cryptanalysis of 4-Bit Crypto S-Boxes in Smart Applications;Security in Smart Cities: Models, Applications, and Challenges;2018-11-05
2. Irreducibility and Deterministic r-th Root Finding over Finite Fields;Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation;2017-07-23
3. Deterministic polynomial factoring and association schemes;LMS Journal of Computation and Mathematics;2014
4. Cryptography;Handbook of Finite Fields;2013-06-17
5. Algorithms for Relatively Cyclotomic Primes;Fundamenta Informaticae;2013