Contradiction Immunity and Guess-Then-Determine Attacks on Gost

DOI10.2478/v10127-012-0039-3zbMath1308.94066OpenAlexW2167275344MaRDI QIDQ4906251

Guangyan Song, Nicolas T. Courtois, Jerzy August Gawinecki

Publication date: 11 February 2013

Published in: Tatra Mountains Mathematical Publications (Search for Journal in Brave)

Full work available at URL: http://tatra.mat.savba.sk/Full/53/04CuGaSo.pdf

zbMATH Keywords

DEScombinatorial optimizationblock cipherscryptanalysisSAT solversGOSTmeet in the middleguess-then-determinelow-data complexity

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (6)

Can a differential attack work for an arbitrarily large number of rounds? ⋮ On black-box optimization in divide-and-conquer SAT solving ⋮ Finding Effective SAT Partitionings Via Black-Box Optimization ⋮ LOW DATA COMPLEXITY DIFFERENTIAL - ALGEBRAIC ATTACK ON REDUCED ROUND DES ⋮ An Improved Differential Attack on Full GOST ⋮ Unnamed Item

This page was built for publication: Contradiction Immunity and Guess-Then-Determine Attacks on Gost