Hard Functions for Low-Degree Polynomials Over Prime Fields

ACM Transactions on Computation Theory - United States
doi 10.1145/2493246.2493248
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computing Machinery (ACM)

Related search

Hard Functions for Low-Degree Polynomials Over Prime Fields

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Key Polynomials Over Valued Fields

Publicacions Matematiques
Mathematics
2020English

Coordinate Blinding Over Large Prime Fields

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Perturbing Eisenstein Polynomials Over Local Fields

Journal de Theorie des Nombres de Bordeaux
Number TheoryAlgebra
2018English

Finding Irreducible Polynomials Over Finite Fields

1986English

Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

New Algorithms for Finding Irreducible Polynomials Over Finite Fields

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1990English

New Linear Codes Over Non-Prime Fields

Cryptography and Communications
Computational TheoryCommunicationsComputer NetworksApplied MathematicsMathematics
2018English

Factoring Polynomials Over Finite Fields: A Survey

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy