Pages that link to "Item:Q5659665"
From MaRDI portal
The following pages link to Factoring Polynomials Over Large Finite Fields (Q5659665):
Displaying 50 items.
- Random sampling in computational algebra: Helly numbers and violator spaces (Q277210) (← links)
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) (Q509886) (← links)
- A note on Gao's algorithm for polynomial factorization (Q633632) (← links)
- Decomposition of algebras over finite fields and number fields (Q685720) (← links)
- A public key cryptosystem based on Diophantine equations of degree increasing type (Q740123) (← links)
- Functional decomposition of polynomials: the tame case (Q753496) (← links)
- On algorithms to find \(p\)-ordering (Q831740) (← links)
- Factoring bivariate sparse (lacunary) polynomials (Q883330) (← links)
- On weak keys and forgery attacks against polynomial-based MAC schemes (Q901368) (← links)
- Factoring polynomials modulo special primes (Q909466) (← links)
- On the deterministic complexity of factoring polynomials over finite fields (Q911294) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- Factoring polynomials using fewer random bits (Q912919) (← links)
- On splitting sets in block designs and finding roots of polynomials (Q915734) (← links)
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\) (Q932799) (← links)
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741) (← links)
- Ramanujan's class invariants and their use in elliptic curve cryptography (Q988264) (← links)
- Permutation group approach to association schemes (Q1039422) (← links)
- A secure and scalable group key exchange system (Q1041738) (← links)
- Factoring multivariate polynomials over finite fields (Q1065867) (← links)
- Algebraic algorithms in GF(q) (Q1066670) (← links)
- Factoring sparse multivariate polynomials (Q1080656) (← links)
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- Factoring polynomials and primitive elements for special primes (Q1095971) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- A cryptographic system based on finite field transforms (Q1144545) (← links)
- A cryptosystem for multiple communication (Q1145121) (← links)
- An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p) (Q1151027) (← links)
- Uniform complexity and digital signatures (Q1154262) (← links)
- Smoothness and factoring polynomials over finite fields (Q1178194) (← links)
- Practic zero-knowledge proofs: Giving hints and using deficiencies (Q1180509) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- A heuristic irreducibility test for univariate polynomials (Q1186702) (← links)
- A new approach to the symbolic factorization of multivariate polynomials (Q1228373) (← links)
- Fast rectangular matrix multiplication and applications (Q1271174) (← links)
- Sentences over integral domains and their computational complexities (Q1286369) (← links)
- Decomposition of algebras over \(F_ q(X_ 1,\dots,X_ m)\) (Q1320439) (← links)
- On the CM character of the curves \(y^ 2=x^ q-1\) (Q1356235) (← links)
- A modular method for computing the Galois groups of polynomials (Q1358933) (← links)
- Short presentations for finite groups (Q1365014) (← links)
- Massively parallel search for linear factors in polynomials with many variables (Q1366832) (← links)
- Massively parallel factorizations of polynomials with many non-commuting variables (Q1392026) (← links)
- Verification of the Miller-Rabin probabilistic primality test. (Q1400288) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- Optimal forgeries against polynomial-based MACs and GCM (Q1648808) (← links)
- EFLASH: a new multivariate encryption scheme (Q1726680) (← links)
- Two varieties of finite automaton public key cryptosystem and digital signatures (Q1820751) (← links)
- Deterministic irreducibility testing of polynomials over large finite fields (Q1825030) (← links)
