scispace - formally typeset
Open AccessPosted Content

New Technique for Solving Sparse Equation Systems.

Håvard Raddum, +1 more
- 01 Jan 2006 - 
- Vol. 2006, pp 475
Reads0
Chats0
About
This article is published in IACR Cryptology ePrint Archive.The article was published on 2006-01-01 and is currently open access. It has received 72 citations till now. The article focuses on the topics: Sparse approximation & Equation solving.

read more

Content maybe subject to copyright    Report

Citations
More filters
Book ChapterDOI

Algebraic cryptanalysis of the data encryption standard

TL;DR: In this article, the authors presented algebraic attacks on 6 rounds of DES and 12 rounds of AES S-boxes, using only one plaintext (instead of a very large quantity) for only six rounds.
Book ChapterDOI

Optimizing SHA256 in Bitcoin Mining

TL;DR: This paper revisit the cryptographic process which allows one to make money by producing new bitcoins, reformulate this problem as a specific sort of Constrained Input Small Output (CISO) hashing problem and reduce the problem to a pure block cipher problem.
Book ChapterDOI

Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT

TL;DR: The first linear hulls are computed in practice for the original PRESENT cipher, which corroborated and even improved on the predicted bias (and the corresponding attack complexities) of conventional linear relations based on a single linear trail.
Book ChapterDOI

Algebraic Techniques in Differential Cryptanalysis

TL;DR: In this paper, a new cryptanalytic method against block ciphers, which combines both algebraic and statistical techniques, is proposed, which uses algebraic relations arising from differential characteristics to speed up and improve key-recovery differential attacks.
Book ChapterDOI

Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers

TL;DR: This paper presents the first results on AIDA/cube, algebraic and side-channel attacks on variable number of rounds of all members of the KATAN family of block ciphers, and shows how to reduce the attack complexity by combining the cube attack with the algebraic attack to recover the full 80-bit key.
Related Papers (5)