Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited

DOI10.1016/j.tcs.2017.03.005zbMath1370.68337OpenAlexW2596015976MaRDI QIDQ527403

Zhen Yu Huang, Dong-Dai 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)

Related Items (1)

On the efficiency of solving Boolean polynomial systems with the characteristic set method

Uses Software

• Serpent

Cites Work

• Unnamed Item
• Unnamed Item
• Characteristic set algorithms for equation solving in finite fields
• A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
• Minimal achievable approximation ratio for MAX-MQ in finite fields
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Satisfying Degree-d Equations over GF[2 n]
• A New Method for Solving Polynomial Systems with Noise over $\mathbb{F}_2$ and Its Applications in Cold Boot Key Recovery
• Serpent: A New Block Cipher Proposal
• A CHART FOR THE INCOMPLETE BETA-FUNCTION AND THE CUMULATIVE BINOMIAL DISTRIBUTION
• Cryptography and Coding

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