Probabilistic Algorithms in Finite Fields
From MaRDI portal
Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55) Software, source code, etc. for problems pertaining to field theory (12-04) Analysis of algorithms and problem complexity (68Q25)
Cited in
(75)- Probabilistic algorithm for finding roots of linearized polynomials
- A secure and scalable group key exchange system
- Concatenation of pseudorandom binary sequences
- Algebraic algorithms in GF(q)
- Irreducibility of multivariate polynomials
- Complete divisibility problems for slowly utilized oracles
- Factoring polynomials and primitive elements for special primes
- Univariate polynomial factorization over finite fields
- An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)
- Uniform complexity and digital signatures
- Arithmetic of finite fields
- Practic zero-knowledge proofs: Giving hints and using deficiencies
- Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
- On the period length of generalized inversive pseudorandom number generators
- Short presentations for finite groups
- Randomised algorithms
- The time-precision tradeoff problem on on-line probabilistic Turing machines
- Computation of orders and cycle lengths of automorphisms of finite solvable groups
- Computing newforms using supersingular isogeny graphs
- On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves
- Non-malleability against polynomial tampering
- Computing Frobenius maps and factoring polynomials
- Cryptanalysis of the CLT13 multilinear map
- Homomorphic public-key cryptosystems and encrypting Boolean circuits
- On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\)
- On non-Abelian homomorphic public-key cryptosystems
- Constructing normal bases in finite fields
- Computing the structure of finite algebras
- Analysis of Rabin's irreducibility test for polynomials over finite fields
- Computing characteristic polynomials of matrices of structured polynomials
- Computing in Picard groups of projective curves over finite fields
- Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm
- Constructing irreducible polynomials over finite fields
- Deterministic root finding over finite fields using Graeffe transforms
- On taking square roots without quadratic nonresidues over finite fields. With an Appendix by Lawrence C. Washington
- Trading GRH for algebra: algorithms for factoring polynomials and related structures
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- Optimal ancilla-free Pauli+V circuits for axial rotations
- Factoring Multivariate Polynomials over Large Finite Fields
- Calculating the set of orders of elements in the finite linear groups
- Classifying the computational complexity of problems
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Power roots of polynomials over arbitrary fields
- Subquadratic-time factoring of polynomials over finite fields
- Computing special powers in finite fields
- Computing modular polynomials and isogenies of rank two Drinfeld modules over finite fields
- Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
- Deterministic polynomial factoring and association schemes
- Counting solutions to polynomial systems via reductions
- On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average
- Supersingular curves with small noninteger endomorphisms
- Factoring polynomials over finite fields: A survey
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- Univariate polynomial factorization over finite fields with large extension degree
- Characterization of irreducible polynomials over a special principal ideal ring
- Satisfiability modulo finite fields
- Limits on the power of prime-order groups: separating Q-type from static assumptions
- Traceable secret sharing: strong security and efficient constructions
- On quasilinear-time complexity theory
- Doubly isogenous curves of genus two with a rational action of D₆
- Decomposition of algebras over finite fields and number fields
- Derandomization with pseudorandomness
- Computing supersingular endomorphism rings using inseparable endomorphisms
- Factorization and irreducibility of composed products
- Modular composition via factorization
- Pseudo-deterministic construction of irreducible polynomials over finite fields
- Key attack on the ACDGV matrix encryption scheme
- Oblivious ciphertext compression via linear codes
- The SEA algorithm for endomorphisms of supersingular elliptic curves
- Finite Fields
- A probabilistic lower bound for checking disjointness of sets
- 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
This page was built for publication: Probabilistic Algorithms in Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3910619)
