Selecting polynomials for the Function Field Sieve (original) (raw)
Related papers
SHASHANK SINGH (RA2132241030020)
IACR Cryptol. ePrint Arch., 2016
SHASHANK SINGH (RA2132241030020)
Advances in Cryptology – ASIACRYPT 2016, 2016
Non-linear polynomial selection for the number field sieve
Journal of Symbolic Computation, 2012
On the cubic sieve method for computing discrete logarithms over prime fields
International Journal of Computer Mathematics, 2005
New Discrete Logarithm Computation for the Medium Prime Case Using the Function Field Sieve
Advances in Mathematics of Communications, 2022
2016
PRIME GENERATING POLYNOMIALS: SIEVE AND MANIPULATIONS
Engineering Science Letters, 2013
Algorithms for Factoring Polynomials over Finite Fields
Finite Fields and Applications, 2001
ACM Symposium on Theory of Computing, 1990
The number field sieve (NFS), Sec. 5.1.3
1992
A New Approach for Finding Low-Weight Polynomial Multiples
Information Security and Cryptology, 2021
Determination of irreducible and primitive polynomials over a binary finite field
Testing low-degree polynomials over prime fields
Random Structures and Algorithms, 2009
Division Algorithm to search for monic irreducible polynomials over extended Galois Field GF(p^q)
IACR Cryptol. ePrint Arch., 2020
Polynomials over Finite Fields and Applications
2006
An Algorithm to Find the Irreducible Polynomials Over Galois Field GF(pm)
International Journal of Computer Applications, 2015
Smoothness Test for Polynomials Defined Over Small Characteristic Finite Fields
Mathematics in Computer Science, 2018
The Computational Efficacy of Finite-Field Arithmetic
Theoretical Computer Science, 1993
Testing low-degree polynomials over GF (2)
2003
Factorization Algorithms for Polynomials over Finite Fields
2011
Algorithms for polynomial GCD computation over algebraic function fields
Proceedings of the 2004 international symposium on Symbolic and algebraic computation - ISSAC '04, 2004
Factoring polynomials over arbitrary finite fields
Theoretical Computer Science, 2000
ANZIAM Journal, 2007
On some computational and applications of finite fields
2020
On square-free factorization of multivariate polynomials over a finite field
Theoretical Computer Science, 1997
Efficient Software-Implementation of Finite Fields with Applications to Cryptography
Acta Applicandae Mathematicae, 2006
Practical polynomial factoring in polynomial time
Proceedings of the 36th international symposium on Symbolic and algebraic computation, 2011
A Survey of Discrete Logarithm Algorithms in Finite Fields
2019
Factoring integers with the number field sieve
Carl Pomerance, Hendrik Lenstra
1993
Fast evaluation of logarithms in fields of characteristic two
IEEE Transactions on Information Theory, 1984
On computing greatest common divisors with polynomials given by black boxes for their evaluations
1995