Factoring Polynomials Over Large Finite Fields
From MaRDI portal
Publication:5659665
DOI10.2307/2004849zbMath0247.12014OpenAlexW4231018896MaRDI QIDQ5659665
Publication date: 1971
Full work available at URL: https://doi.org/10.2307/2004849
Related Items
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring, An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function, New Sparse Multivariate Polynomial Factorization Algorithms over Integers, SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption, Accelerating the Delfs-Galbraith algorithm with fast subfield root detection, Proving an execution of an algorithm correct?, Univariate polynomial factorization over finite fields with large extension degree, Computing primitive idempotents in finite commutative rings and applications, Methodologies of Symbolic Computation, 2F -- a new method for constructing efficient multivariate encryption schemes, On Bivariate Polynomial Factorization over Finite Fields, Modular polynomials via isogeny volcanoes, Factoring polynomials over special finite fields, Factoring polynomials over finite fields: A survey, On the deterministic complexity of factoring polynomials, Factoring polynomials over local fields., Unnamed Item, On the efficient generation of prime-order elliptic curves, Unnamed Item, Recent Developments in Multivariate Public Key Cryptosystems, Factoring polynomials over finite fields, Using zeta functions to factor polynomials over finite fields, Character sums and deterministic polynomial root finding in finite fields, A Generalised Successive Resultants Algorithm, Deterministic root finding in finite fields, Multi-round Secure Light-Weight Broadcast Exclusion Protocol with Pre-processing, Non-malleable functions and their applications, Factoring sparse multivariate polynomials, Random sampling in computational algebra: Helly numbers and violator spaces, Irreducibility of multivariate polynomials, Computing Frobenius maps and factoring polynomials, On algorithms to find \(p\)-ordering, Factoring multivariate polynomials via partial differential equations, Succinct non-interactive arguments via linear interactive proofs, Deterministic root finding over finite fields using Graeffe transforms, An Improved Multivariate Polynomial Factoring Algorithm, Unnamed Item, Factoring polynomials and primitive elements for special primes, On the CM character of the curves \(y^ 2=x^ q-1\), Computing the structure of finite algebras, A modular method for computing the Galois groups of polynomials, Optimal forgeries against polynomial-based MACs and GCM, A relative van Hoeij algorithm over number fields, Polynomial factorization algorithms over number fields, Short presentations for finite groups, Massively parallel search for linear factors in polynomials with many variables, Mathematical problems in cryptology, Univariate polynomial factorization over finite fields, Algebraic Cryptanalysis of Yasuda, Takagi and Sakurai’s Signature Scheme, Factoring bivariate sparse (lacunary) polynomials, All in the \(C^*\) family, Algebraic theory of block codes detecting independent errors, On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes, Massively parallel factorizations of polynomials with many non-commuting variables, Verification of the Miller-Rabin probabilistic primality test., A cryptographic system based on finite field transforms, Power roots of polynomials over arbitrary fields, A cryptosystem for multiple communication, On weak keys and forgery attacks against polynomial-based MAC schemes, An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p), Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time, A note on Gao's algorithm for polynomial factorization, On the discrete logarithm problem in finite fields of fixed characteristic, Uniform complexity and digital signatures, Factoring polynomials modulo special primes, On the deterministic complexity of factoring polynomials over finite fields, Analysis of Euclidean algorithms for polynomials over finite fields, Factoring polynomials using fewer random bits, On splitting sets in block designs and finding roots of polynomials, McEliece Cryptosystem Implementation: Theory and Practice, A New Algorithm for Factoring Polynomials Over Finite Fields, EFLASH: a new multivariate encryption scheme, Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\), Smoothness and factoring polynomials over finite fields, Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields, Practic zero-knowledge proofs: Giving hints and using deficiencies, An introduction to randomized algorithms, A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields, Efficient decomposition of associative algebras over finite fields, Factoring Multivariate Polynomials over Algebraic Number Fields, Elliptic Curves and Primality Proving, A heuristic irreducibility test for univariate polynomials, Break Finite Automata Public Key Cryptosystem, A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\), On taking square roots without quadratic nonresidues over finite fields, The Distribution of Lucas and Elliptic Pseudoprimes, Decomposition of algebras over finite fields and number fields, A note on Gröbner bases and Berlekamp's algorithm, A fast parallel sparse polynomial GCD algorithm, Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes, New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, Complexity of solving parametric polynomial systems, Subquadratic-time factoring of polynomials over finite fields, Lower bounds for non-black-box zero knowledge, On the Complexity of the Montes Ideal Factorization Algorithm, How should we solve search problems privately?, Theory of computational complexity. Part 9. Transl. from the Russian., A new approach to the symbolic factorization of multivariate polynomials, Primary decomposition of zero-dimensional ideals over finite fields, Ramanujan's class invariants and their use in elliptic curve cryptography, Factoring Multivariate Polynomials over Large Finite Fields, On a family of preimage-resistant functions, A public key cryptosystem based on Diophantine equations of degree increasing type, Computation of orders and cycle lengths of automorphisms of finite solvable groups, Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields, Functional decomposition of polynomials: the tame case, Fast rectangular matrix multiplication and applications, Factoring Multivariate Polynomials Over the Integers, Two varieties of finite automaton public key cryptosystem and digital signatures, Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices, Deterministic irreducibility testing of polynomials over large finite fields, Sentences over integral domains and their computational complexities, Permutation group approach to association schemes, Reconstructing Algebraic Functions from Mixed Data, A secure and scalable group key exchange system, Randomised algorithms, Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey, Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings, Chosen ciphertext attack on ZHFE, A conversion algorithm for logarithms on \(GF(2^n)\), Factoring multivariate polynomials over finite fields, Algebraic algorithms in GF(q), Equivalence of polynomial identity testing and polynomial factorization, Decomposition of algebras over \(F_ q(X_ 1,\dots,X_ m)\), Polynomial factorization over ${\mathbb F}_2$, On the effect of projection on rank attacks in multivariate cryptography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On inverses of Vandermonde and confluent Vandermonde matrices
- On Hensel factorization. I
- ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD
- On Character Sums and Primitive Roots†
- Factorization of the General Polynomial by Means of Its Homomorphic Congruential Functions
- On the solution of algebraic equations over finite fields
- An Irreducibility Criterion for Polynomials Over the Integers
- Computing Multiplicative Inverses in GF(p)
- On the irreducibility of certain polynomials
