Results 11 to 20 of about 458 (184)

Algebraic Techniques in Differential Cryptanalysis [PDF]

open access: bronze, 2009
In this paper we propose a new cryptanalytic method against block ciphers, which combines both algebraic and statistical techniques. More specifically, we show how to use algebraic relations arising from differential characteristics to speed up and improve key-recovery differential attacks against block ciphers.
M. Albrecht, Carlos Cid
openalex   +10 more sources

Algebraic Techniques in Linear Cryptanalysis [PDF]

open access: goldProceedings of the 2012 2nd International Conference on Computer and Information Applications (ICCIA 2012), 2012
Linear cryptanalysis is a statistical analysis method. Linear cryptanalysis constructs probabilistic patterns first and then distinguishes the cipher from a random permutation using lots of plaintext-ciphertext pairs. Linear cryptanalysis has a big data complexity. Algebraic attack attempts to exploit the algebraic structure of the cipher by expressing
Hongru Wei, Yafei Zheng
openalex   +5 more sources

Algebraic Cryptanalysis of 58-Round SHA-1 [PDF]

open access: bronze, 2007
In 2004, a new attack against SHA-1 has been proposed by a team leaded by Wang [15]. The aim of this article is to sophisticate and improve Wang’s attack by using algebraic techniques. We introduce new notions, namely semi-neutral bit and adjuster and propose then an improved message modification technique based on algebraic techniques.
Makoto Sugita   +3 more
openalex   +3 more sources

Formal Power Series on Algebraic Cryptanalysis

open access: green, 2020
In the complexity estimation for an attack that reduces a cryptosystem to solving a system of polynomial equations, the degree of regularity and an upper bound of the first fall degree are often used in cryptanalysis. While the degree of regularity can be easily computed using a univariate formal power series under the semi-regularity assumption ...
Shuhei Nakamura
openalex   +4 more sources

Algebraic Cryptanalysis of Present Based on the Method of Syllogisms [PDF]

open access: hybridTatra Mountains Mathematical Publications, 2012
ABSTRACT In this paper algebraic cryptanalysis of block cipher Present based on the method of syllogisms is presented. Different guessing strategies of the method of syllogisms were used and significantly different complexities of attack were reached.
Lucia Lacko-Bartošová
openalex   +3 more sources

Methods to solve algebraic equations in cryptanalysis [PDF]

open access: hybridTatra Mountains Mathematical Publications, 2010
ABSTRACT The goal of the present paper is a survey of methods to solve equation systems common in cryptanalysis. The methods depend on the equation representation and fall into three categories: Gröbner basis algorithms, SAT-solving methods and Agreeing-Gluing algorithms.
Igor Semaev, Michal Mikuš
openalex   +3 more sources

Algebraic Cryptanalysis of Simplified AES∗ [PDF]

open access: greenCryptologia, 2009
Abstract Simplified AES was developed in 2003, as a teaching tool to help students understand AES. It was designed so that the two primary attacks on symmetric-key block ciphers of that time, differential cryptanalysis and linear cryptanalysis, are not trivial on simplified AES.
Sean Simmons
openalex   +2 more sources

Cryptanalysis of Algebraic Verifiable Delay Functions

open access: bronze
Verifiable Delay Functions (VDF) are a class of cryptographic primitives aiming to guarantee a minimum computation time, even for an adversary with massive parallel computational power. They are useful in blockchain protocols, and several practical candidates have been proposed based on exponentiation in a large finite field: Sloth++, Veedo, MinRoot ...
Alex Biryukov   +6 more
openalex   +3 more sources

Algebraic Cryptanalysis of the PKC’2009 Algebraic Surface Cryptosystem [PDF]

open access: bronze, 2010
In this paper, we fully break the Algebraic Surface Cryptosystem (ASC for short) proposed at PKC’2009 [3]. This system is based on an unusual problem in multivariate cryptography: the Section Finding Problem. Given an algebraic surface $X(x,y,t)\in\mathbb{F}_p[x,y,t]$ such that $\deg_{xy} X(x,y,t)= w$, the question is to find a pair of polynomials of ...
Jean‐Charles Faugère   +1 more
  +5 more sources

Algebraic Cryptanalysis of Block Ciphers

open access: goldProceedings of the 2019 International Conference on Wireless Communication, Network and Multimedia Engineering (WCNME 2019), 2019
Rustem Biyashev   +3 more
openalex   +3 more sources

Home - About - Disclaimer - Privacy