Results 61 to 70 of about 950 (154)

MRHS solver based on linear algebra and exhaustive search

Journal of Mathematical Cryptology, 2018
We show how to build a binary matrix from the MRHS representation of a symmetric-key cipher. The matrix contains the cipher represented as an equation system and can be used to assess a cipher’s resistance against algebraic attacks.
Raddum Håvard, Zajac Pavol
doaj   +1 more source

Combining Algebraic and Side-Channel Cryptanalysis against Block Ciphers [PDF]

, 2009
This paper introduces a new type of cryptanalysis against block ciphers, denoted as algebraic side-channel attacks. In these attacks, we first write the target block cipher as a system of low degree equations.
Standaert, François-Xavier, Renauld, Mathieu, Proceedings of the 30th Symposium on Information Theory in the Benelux   +2 more
core  

Cryptanalysis of the Hidden Matrix Cryptosystem [PDF]

, 2010
International audienceIn this paper, we present an efficient cryptanalysis of the so-called HM cryptosystem which was published at Asiacrypt’1999, and one perturbed version of HM. Until now, this scheme was exempt from cryptanalysis.
Perret, Ludovic, Treger, Joana, Faugère, Jean-Charles, Jean-Charles Faugère, Antoine Joux, Joana Treger, Joux, Antoine, Ludovic Perret   +7 more
core   +1 more source

Preprocessing Techniques in Algebraic Cryptanalysis [PDF]

Algebraic cryptanalysis is a standard set of techniques for analyzing and attacking practical symmetric cryptographic primitives. It involves representing the relationship between a pair of plaintext, ciphertext and the key as a system of polynomial ...
Mašková, Kristýna
core  

Almost fully optimized infinite classes of Boolean functions resistant to (fast) algebraic cryptanalysis [PDF]

, 2013
In this paper the possibilities of an iterative concatenation method towards construction of Boolean functions resistant to algebraic cryptanalysis are investigated.
Pašalić, Enes
core  

HHL Algorithm for Tensor-Decomposable Matrices

Quantum Reports
We use the HHL algorithm to retrieve a quantum state holding the algebraic normal form (ANF) of a Boolean function. Unlike the standard HHL applications, we do not describe the cipher as an exponentially big system of equations.
Cezary Pilaszewicz, Marian Margraf
doaj   +1 more source

Key-Recovery Attacks on Full Kravatte

IACR Transactions on Symmetric Cryptology, 2018
This paper presents a cryptanalysis of full Kravatte, an instantiation of the Farfalle construction of a pseudorandom function (PRF) with variable input and output length.
Colin Chaigneau, Thomas Fuhr, Henri Gilbert, Jian Guo, Jérémy Jean, Jean-René Reinhard, Ling Song   +6 more
doaj   +1 more source

Algebraic and Logic Solving Methods for Cryptanalysis [PDF]

, 2020
Algebraic solving of polynomial systems and satisfiability of propositional logic formulas are not two completely separate research areas, as it may appear at first sight. In fact, many problems coming from cryptanalysis, such as algebraic fault attacks,
Horáček, Jan
core  

An Algebraic Cryptanalysis of Nonlinear Filter Generators using Gröbner bases [PDF]

, 2003
This paper presents an algebraic cryptanalysis of nonlinear filter generator. A linear shift register of length L filtered by a non linear boolear function f of degree deg(f) is equivalently described by a set of algebraic equations. More precisely, if N
Faugère, Jean-Charles, Ars, Gwénolé
core   +3 more sources

Minimal basis of the syzygies module of leading terms

Труды Института системного программирования РАН, 2019
Systems of polynomial equations are one of the most universal mathematical objects. Almost all the problems of cryptographic analysis can be reduced to finding solutions to systems of polynomial equations.
A. V. Sokurov
doaj   +1 more source