Results 71 to 80 of about 235,655 (162)

Parameters of Algebraic Representation vs. Efficiency of Algebraic Cryptanalysis [PDF]

The aim of an algebraic attack is to find the secret key by solving a collection of relations that describe the internal structure of a cipher for observations of plaintext/cipher-text pairs.
Hossein Arabnezhad, Babak Sadeghiyan
core   +1 more source

Higher-order differences based research on comparison between type-1 generalized Feistel-SP network and Feistel-SPSP network

Tongxin xuebao, 2014
The powers against the higher-order differential cryptanalysis of the single-SP(substitution-permutation) model and the double-SP model are studied in the type-1 Feistel network by analyzing the growths of algebraic degrees.
ONGLe D, UJiao D, UWen-ling W
doaj   +2 more sources

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

Improved algebraic cryptanalysis of QUAD, Bivium and Trivium via graph partitioning on equation systems [PDF]

, 2010
We present a novel approach for preprocessing systems of polynomial equations via graph partitioning. The variable-sharing graph of a system of polynomial equations is defined. If such graph is disconnected, then the corresponding system of equations can
Wong, Kenneth Koon-Ho, Bard, Gregory V., Kenneth Koon-Ho Wong, Gregory V. Bard   +3 more
core   +2 more sources

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

Practical Algebraic Cryptanalysis for Dragon-based Cryptosystems

, 2010
Recently, the Little Dragon Two and Poly-Dragon multivariate based public-key cryptosystems were proposed as efficient and secure schemes. In particular, the inventors of the two schemes claim that Little Dragon Two and Poly-Dragon resist algebraic ...
Johannes Buchmann, Wael Said Abd Elmageed Mohamed, Stanislav Bulygin, Jintai Ding, Mohamed, Wael Said Abd Elmageed, Fabian Werner, Bulygin, Stanislav, Werner, Fabian, Ding, Jintai, Buchmann, Johannes   +9 more
core   +1 more source

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

, 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   +1 more source

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

Random subgroups and analysis of the length-based and quotient attacks

Journal of Mathematical Cryptology, 2008
In this paper we discuss generic properties of “random subgroups” of a given group G. It turns out that in many groups G (even in most exotic of them) the random subgroups have a simple algebraic structure and they “sit” inside G in a very particular way.
Myasnikov Alexei G., Ushakov Alexander
doaj   +1 more source