Pages that link to "Item:Q5659665"
From MaRDI portal
The following pages link to Factoring Polynomials Over Large Finite Fields (Q5659665):
Displaying 50 items.
- Randomised algorithms (Q1836980) (← links)
- A conversion algorithm for logarithms on \(GF(2^n)\) (Q1844260) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- Efficient decomposition of associative algebras over finite fields (Q1976671) (← links)
- A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
- Computation of orders and cycle lengths of automorphisms of finite solvable groups (Q2048160) (← links)
- On the effect of projection on rank attacks in multivariate cryptography (Q2118528) (← links)
- Non-malleable functions and their applications (Q2121503) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- All in the \(C^*\) family (Q2182072) (← links)
- Complexity of solving parametric polynomial systems (Q2256707) (← links)
- How should we solve search problems privately? (Q2267364) (← links)
- Equivalence of polynomial identity testing and polynomial factorization (Q2351391) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time (Q2431341) (← links)
- Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields (Q2457415) (← links)
- A note on Gröbner bases and Berlekamp's algorithm (Q2474859) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Theory of computational complexity. Part 9. Transl. from the Russian. (Q2494566) (← links)
- Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings (Q2567153) (← links)
- Computing the structure of finite algebras (Q2640676) (← links)
- A relative van Hoeij algorithm over number fields (Q2643532) (← links)
- Polynomial factorization algorithms over number fields (Q2643570) (← links)
- Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)
- Algebraic Cryptanalysis of Yasuda, Takagi and Sakurai’s Signature Scheme (Q2942826) (← links)
- On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes (Q2946883) (← links)
- On taking square roots without quadratic nonresidues over finite fields (Q3015058) (← links)
- Primary decomposition of zero-dimensional ideals over finite fields (Q3055105) (← links)
- On a family of preimage-resistant functions (Q3075868) (← links)
- Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices (Q3102789) (← links)
- Chosen ciphertext attack on ZHFE (Q3121477) (← links)
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields (Q3137444) (← links)
- Elliptic Curves and Primality Proving (Q3137447) (← links)
- Polynomial factorization over ${\mathbb F}_2$ (Q3147181) (← links)
- Factoring Multivariate Polynomials over Large Finite Fields (Q3478494) (← links)
- McEliece Cryptosystem Implementation: Theory and Practice (Q3535350) (← links)
- A New Algorithm for Factoring Polynomials Over Finite Fields (Q3955477) (← links)
- The Distribution of Lucas and Elliptic Pseudoprimes (Q3980483) (← links)
- Factoring Multivariate Polynomials Over the Integers (Q4068830) (← links)
- Factoring Multivariate Polynomials over Algebraic Number Fields (Q4100173) (← links)
- An Improved Multivariate Polynomial Factoring Algorithm (Q4168687) (← links)
- Reconstructing Algebraic Functions from Mixed Data (Q4210162) (← links)
- Power roots of polynomials over arbitrary fields (Q4324085) (← links)
- Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
- (Q4401408) (← links)
- On the discrete logarithm problem in finite fields of fixed characteristic (Q4604404) (← links)
- Break Finite Automata Public Key Cryptosystem (Q4645174) (← links)
- Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)
- On the Complexity of the Montes Ideal Factorization Algorithm (Q4931648) (← links)
