Image de couverture de livre

Attacking the Polynomials in the Maze of Finite Fields problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Barbero, Àngela, Freij-Hollanti, Ragnar, Hollanti, Camilla, Raddum, Håvard, Ytrehus, Øyvind, Øygarden, Morten
Format:	Preprint
Publié:	2026
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A $q$-Polymatroid Framework for Information Leakage in Secure Linear Network Coding
par: Byrne, Eimear, et autres
Publié: (2026)

Function-Correcting Partition Codes
par: Rajput, Charul, et autres
Publié: (2026)

Non-Existence of Some Function-Correcting Codes With Data Protection
par: Rajput, Charul, et autres
Publié: (2026)

Existence and Constructions of Strict Function-Correcting Codes with Data Protection
par: Rajput, Charul, et autres
Publié: (2026)

Secret Sharing in the Rank Metric
par: Dinesen, Johan Vester, et autres
Publié: (2025)

Function-Correcting Codes With Data Protection
par: Rajput, Charul, et autres
Publié: (2025)

Function-Correcting Codes for Locally Bounded Functions
par: Rajput, Charul, et autres
Publié: (2025)

Simplex inequalities of order and chain polytopes of recursively defined posets
par: Freij-Hollanti, Ragnar, et autres
Publié: (2025)

Matroidal Cycles and Hypergraph Families
par: Freij-Hollanti, Ragnar, et autres
Publié: (2024)

$f$-vector inequalities for order and chain polytopes
par: Freij-Hollanti, Ragnar, et autres
Publié: (2023)

The Star Product of Uniformly Random Codes
par: Dinesen, Johan V., et autres
Publié: (2025)

Two-Dimensional Faces of Order and Chain Polytopes
par: Freij-Hollanti, Ragnar, et autres
Publié: (2025)

Perfectly-Private Analog Secure Aggregation in Federated Learning
par: Jaramillo-Velez, Delio, et autres
Publié: (2025)

Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack
par: Verma, Neehar, et autres
Publié: (2024)

Solving Polynomial Equations Over Finite Fields
par: Dell, Holger, et autres
Publié: (2024)

Euclidean lattices: theory and applications
par: Fukshansky, Lenny, et autres
Publié: (2023)

Analog Secure Distributed Matrix Multiplication
par: Makkonen, Okko, et autres
Publié: (2025)

CB-cPIR: Code-Based Computational Private Information Retrieval
par: Hollanti, Camilla, et autres
Publié: (2025)

General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers
par: Makkonen, Okko, et autres
Publié: (2022)

Pseudo-Deterministic Construction of Irreducible Polynomials over Finite Fields
par: Rai, Shanthanu S
Publié: (2024)

Low-Rank Tensor Decomposition over Finite Fields
par: Yang, Jason
Publié: (2024)

Lower Bounds against the Ideal Proof System in Finite Fields
par: Elbaz, Tal, et autres
Publié: (2025)

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP
par: Grüne, Christoph, et autres
Publié: (2026)

Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields
par: Dwivedi, Ashish, et autres
Publié: (2024)

A New Reduction Method from Multivariate Polynomials to Univariate Polynomials
par: Wang, Cancan, et autres
Publié: (2024)

Computing $p$-presentation distances is hard
par: Bjerkevik, Håvard Bakke, et autres
Publié: (2024)

Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata
par: Yamakami, Tomoyuki
Publié: (2023)

Lifting with Inner Functions of Polynomial Discrepancy
par: Manor, Yahel, et autres
Publié: (2024)

Symmetric Algebraic Circuits and Homomorphism Polynomials
par: Dawar, Anuj, et autres
Publié: (2025)

On Matrix Multiplication and Polynomial Identity Testing
par: Andrews, Robert
Publié: (2022)

On Boolean PCSPs with Polynomial Threshold Polymorphisms
par: Michno, Katzper
Publié: (2025)

On Factorization of Sparse Polynomials of Bounded Individual Degree
par: Chuyoon, Aminadav, et autres
Publié: (2026)

One-Way Functions and Polynomial Time Dimension
par: Nandakumar, Satyadev, et autres
Publié: (2024)

Computing the Elementary Symmetric Polynomials in Positive Characteristics
par: Orzel, Ian
Publié: (2025)

Secret Sharing for Secure and Private Information Retrieval: A Construction Using Algebraic Geometry Codes
par: Makkonen, Okko, et autres
Publié: (2024)

Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval
par: Makkonen, Okko, et autres
Publié: (2024)

Efficient Polynomial Identity Testing Over Nonassociative Algebras
par: Mukhopadhyay, Partha, et autres
Publié: (2025)

Almost Polynomial Factor Inapproximability for Parameterized k-Clique
par: S., Karthik C., et autres
Publié: (2021)

Extractors for Polynomial Sources over $\mathbb{F}_2$
par: Chattopadhyay, Eshan, et autres
Publié: (2023)

Polynomial-Time PIT from (Almost) Necessary Assumptions
par: Andrews, Robert, et autres
Publié: (2025)