Redactable blockchains and polynomial equations

DOI10.1016/J.AAM.2026.103149MaRDI QIDQ7356961zbMATH OpenFDO

Authors Aleksandr Viktorovich Demin, Alexey Ovchinnikov, Vladimir Shpilrain

Publication date 25 September 2026

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AAM.2026.103149

Mathematics Subject Classification ID

Solving polynomial systems; resultants (13P15) Algorithms in computer science (68W99) Authentication, digital signatures and secret sharing (94A62)

Cites work

• A new efficient algorithm for computing Gröbner bases (F₄)
• An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
• Generating safe primes
• scientific article; zbMATH DE number 967674 (Why is no real title available?)
• msolve. A library for solving polynomial systems
• Polynomial decomposition algorithms
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Sharper complexity bounds for zero-dimensional Gröbner bases and polynomial system solving

This page was built for publication: Redactable blockchains and polynomial equations

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