Solving polynomial systems with noise over F₂: revisited

DOI10.1016/J.TCS.2017.03.005MaRDI QIDQ527403zbMATHOpenAlexFDO

Authors Zhenyu Huang, Dongdai Lin

Publication date 11 May 2017

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2017.03.005

zbMATH Keywords

Boolean polynomial system with noiseCold Boot attackISBS methodMax-PoSSoSerpent

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Polynomials over finite fields (11T06)

Recommendations

• A new method for solving polynomial systems with noise over \(\mathbb{F}_2\) and its applications in cold boot key recovery
• Noisy polynomial interpolation and noisy Chinese remaindering
• Solvability of bivariate polynomial systems under perturbation
• A continuation method to solve polynomial systems and its complexity
• COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS
• Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
• An improvement of the complexity bound for solving systems of polynomial equations
• Noisy interpolating sets for low-degree polynomials
• Solving polynomial systems over finite fields: improved analysis of the hybrid approach
• Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields

Cites work

• scientific article; zbMATH DE number 1682693 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• A CHART FOR THE INCOMPLETE BETA-FUNCTION AND THE CUMULATIVE BINOMIAL DISTRIBUTION
• A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• A new method for solving polynomial systems with noise over \(\mathbb{F}_2\) and its applications in cold boot key recovery
• Characteristic set algorithms for equation solving in finite fields
• Cryptography and Coding
• Minimal achievable approximation ratio for MAX-MQ in finite fields
• Satisfying degree-\(d\) equations over \(\mathrm{GF}[2]^{n}\)
• Serpent: a new block cipher proposal

Cited in

(3)

• Froissart doublets in Padé approximation in the case of polynomial noise
• A new method for solving polynomial systems with noise over \(\mathbb{F}_2\) and its applications in cold boot key recovery
• On the efficiency of solving Boolean polynomial systems with the characteristic set method

Describes a project that uses

Uses Software

• Serpent

This page was built for publication: Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited

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