On solving sparse algebraic equations over finite fields

DOI10.1007/S10623-008-9182-XzbMath1196.11171OpenAlexW2029845343MaRDI QIDQ1009070

I. A. Semaev

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-008-9182-x

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Related Items (9)

On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables ⋮ MaxMinMax problem and sparse equations over finite fields ⋮ An application of combinatorics in cryptography ⋮ Local reduction and the algebraic cryptanalysis of the block cipher GOST ⋮ A combinatorial problem related to sparse systems of equations ⋮ Sparse Boolean equations and circuit lattices ⋮ Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity ⋮ Improved agreeing-gluing algorithm ⋮ Speeding up deciphering by hypergraph ordering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete limit distributions in the problem of balls falling in cells with arbitrary probabilities
• Information and Communications Security

This page was built for publication: On solving sparse algebraic equations over finite fields