Multivariate exponential equations with unknown coefficients

DOI10.3934/AMC.2026001MaRDI QIDQ6852067zbMATH OpenFDO

Authors

Publication date 26 February 2026

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/AMC.2026001

zbMATH Keywords

average-case hardnessEuclidean domainsmultivariate exponential equationsNP-hardnesspost-quantum cryptographyrandom self-reducibilitysearch-to-decision reducibility

Mathematics Subject Classification ID

Algebraic number theory: global fields (11R99) Algebraic number theory computations (11Y40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cryptography (94A60)

Cites work

• A mean value theorem in geometry of numbers
• A simple obfuscation scheme for pattern-matching with wildcards
• Advances in Cryptology - EUROCRYPT 2004
• An Introduction to Mathematical Cryptography
• Candidate Multilinear Maps from Ideal Lattices
• Cryptanalysis of GGH15 multilinear maps
• Cryptanalysis of the multilinear map over the integers
• Cryptography from learning parity with noise
• Efficient noise-tolerant learning from statistical queries
• Efficient public key encryption based on ideal lattices (extended abstract)
• Explicit Bounds for Primality Testing and Related Problems
• Fast Software Encryption
• GGHLite: more efficient multilinear maps from ideal lattices
• Hardness of SIS and LWE with small parameters
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1024063 (Why is no real title available?)
• scientific article; zbMATH DE number 1996402 (Why is no real title available?)
• scientific article; zbMATH DE number 1542664 (Why is no real title available?)
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• scientific article; zbMATH DE number 2120513 (Why is no real title available?)
• scientific article; zbMATH DE number 865850 (Why is no real title available?)
• Multivariate Public Key Cryptography
• New Multilinear Maps Over the Integers
• New techniques for obfuscating conjunctions
• Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
• Obfuscation of evasive algebraic set membership
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On the inherent intractability of certain coding problems (Corresp.)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Practical multilinear maps over the integers
• PRIMES is in P
• Reusable fuzzy extractors for low-entropy distributions
• Revisiting the hardness of binary error LWE
• Shortest vector from lattice sieving: a few dimensions for free
• Small Superset and Big Subset Obfuscation
• Some problems of Partitio numerorum. III: On the expression of a number as a sum of primes.
• Theory of Cryptography
• Worst-case to average-case reductions for module lattices

This page was built for publication: Multivariate exponential equations with unknown coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852067)