Pages that link to "Item:Q3910619"
From MaRDI portal
The following pages link to Probabilistic Algorithms in Finite Fields (Q3910619):
Displaying 50 items.
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- Decomposition of algebras over finite fields and number fields (Q685720) (← links)
- Modular composition via factorization (Q722764) (← links)
- A probabilistic lower bound for checking disjointness of sets (Q794167) (← 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)
- Probabilistic algorithm for finding roots of linearized polynomials (Q1008961) (← links)
- A secure and scalable group key exchange system (Q1041738) (← links)
- Concatenation of pseudorandom binary sequences (Q1046758) (← links)
- Algebraic algorithms in GF(q) (Q1066670) (← links)
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- Complete divisibility problems for slowly utilized oracles (Q1083192) (← links)
- Factoring polynomials and primitive elements for special primes (Q1095971) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p) (Q1151027) (← links)
- Uniform complexity and digital signatures (Q1154262) (← links)
- Arithmetic of finite fields (Q1167763) (← links)
- Practic zero-knowledge proofs: Giving hints and using deficiencies (Q1180509) (← links)
- Efficient randomized generation of optimal algorithms for multiplication in certain finite fields (Q1198957) (← links)
- On the period length of generalized inversive pseudorandom number generators (Q1328434) (← links)
- Short presentations for finite groups (Q1365014) (← links)
- Randomised algorithms (Q1836980) (← links)
- The time-precision tradeoff problem on on-line probabilistic Turing machines (Q1838301) (← links)
- Computation of orders and cycle lengths of automorphisms of finite solvable groups (Q2048160) (← links)
- Computing newforms using supersingular isogeny graphs (Q2100578) (← links)
- On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves (Q2100582) (← links)
- Non-malleability against polynomial tampering (Q2102059) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- Cryptanalysis of the CLT13 multilinear map (Q2423847) (← links)
- Homomorphic public-key cryptosystems and encrypting Boolean circuits (Q2432559) (← links)
- On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\) (Q2491249) (← links)
- On non-Abelian homomorphic public-key cryptosystems (Q2577587) (← links)
- Constructing normal bases in finite fields (Q2639102) (← links)
- Computing the structure of finite algebras (Q2640676) (← links)
- Analysis of Rabin's irreducibility test for polynomials over finite fields (Q2772930) (← links)
- Computing Characteristic Polynomials of Matrices of Structured Polynomials (Q2830011) (← links)
- Computing in Picard groups of projective curves over finite fields (Q2840629) (← links)
- Finding roots in with the successive resultants algorithm (Q2878836) (← links)
- Constructing irreducible polynomials over finite fields (Q2894527) (← links)
- On taking square roots without quadratic nonresidues over finite fields (Q3015058) (← links)
- Trading GRH for algebra: Algorithms for factoring polynomials and related structures (Q3117221) (← links)
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields (Q3137444) (← links)
- Optimal ancilla-free Pauli+V circuits for axial rotations (Q3463254) (← links)
- Factoring Multivariate Polynomials over Large Finite Fields (Q3478494) (← links)
- Calculating the set of orders of elements in the finite linear groups (Q3545834) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- A New Algorithm for Factoring Polynomials Over Finite Fields (Q3955477) (← links)
