搜索结果: 1-15 共查到“军事学 meet-in-the-middle”相关记录38条 . 查询时间(0.062 秒)
Hashing modes are ways to convert a block cipher into a hash function, and those with AES as the underlying block cipher are referred to as AES hashing modes. Sasaki in 2011 introduced the first preim...
Quantum Meet-in-the-Middle Attacks: Applications to Generic Feistel Constructions
Feistel network Grover's algorithm claw finding algorithm
2017/12/25
This paper shows that quantum computers can significantly speed-up a type of meet-in-the-middle attacks initiated by Demiric and Selçuk (DS-MITM attacks), which is currently one of the most power...
Meet-in-the-Middle Attacks on 3-Line Generalized Feistel Networks
3-line Feistel Meet-in-the-middle attack Key recovery
2017/11/13
In the paper, we study the security of 3-line generalized Feistel network, which is a considerate choice for some special needs, such as designing a 96-bit cipher based on a 32-bit round function. We ...
Meet-in-the-Middle Attack on QARMA Block Cipher
QARMA Lightweight Tweakable Block Cipher Meet-in-the-Middle Attack
2016/12/29
QARMA is a recently published lightweight tweakable block cipher, which has been used by the ARMv8 architecture to support a software protection feature. In this paper, using the method of MITM, we gi...
Meet-in-the-Middle Attacks on Classes of Contracting and Expanding Feistel Constructions
Unbalanced Feistel Generic Attack Key Recovery
2016/12/29
We show generic attacks on unbalanced Feistel ciphers based on the meet-in-the-middle technique. We analyze two general classes of unbalanced Feistel structures, namely contracting Feistels and expand...
A New Algorithm for the Unbalanced Meet-in-the-Middle Problem
meet-in-the-middle tradeoff collision search
2016/12/10
A collision search for a pair of nn-bit unbalanced functions (one is RR times more expensive than the other) is an instance of the meet-in-the-middle problem, solved with the familiar standard algorit...
Improved Meet-in-the-Middle Attacks on Reduced-Round Kalyna-128/256 and Kalyna-256/512
Block Cipher Kalyna Meet-in-the-Middle Attack
2016/7/22
Kalyna is an SPN-based block cipher that was selected during Ukrainian National Public Cryptographic Competition (2007-2010) and its slight modification was approved as the new encryption standard of ...
Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks
automatic search meet-in-the-middle impossible truncated differential
2016/6/7
Tracking bits through block ciphers and optimizing attacks at hand is one of the tedious task symmetric cryptanalysts have to deal with. It would be nice if a program will automatically handle them at...
Improved Meet-in-the-Middle Attacks on Round-Reduced Crypton-256
Cryptanalysis Crypton MITM
2016/3/11
The meet-in-the-middle (MITM) attack has prove to be efficient in analyzing the AES block cipher. Its efficiency has been increasing with the introduction of various techniques such as differential en...
Reduced Memory Meet-in-the-Middle Attack against the NTRU Private Key
cryptanalysis NTRU meet-in-the-middle attack
2016/2/24
NTRU is a public-key cryptosystem introduced at ANTS-III. The two most used techniques
in attacking the NTRU private key are meet-in-the-middle attacks and lattice-basis reduction
attacks. In the 20...
Multidimensional Meet in the Middle Cryptanalysis of KATAN
KATAN Multidimensional Meet in the Middle Attack
2016/2/24
KATAN and KTANTAN are two lightweight families of hardware
oriented block ciphers proposed by Canni`ere et al. at CHES 2009.
They have different versions of 32-, 48- and 64-bit state, all of which
...
On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
Learning with Errors Lattice-based Cryptography Cryptanalysis
2016/2/23
The security of many cryptographic schemes has been based on special instances of the Learning with Errors (LWE) problem, e.g., Ring-LWE, LWE with binary secret, or LWE with ternary error. However, re...
Improved Meet-in-the-Middle Attacks on Reduced-Round Camellia-192/256
Block Cipher Meet-in-the-Middle Camellia
2016/1/23
Camellia is one of the widely used block ciphers, which has been selected as an international standard by ISO/IEC. In this paper, we focus on the key-recovery attacks on reduced-round Camellia-192/2...
Improved Meet-in-the-Middle Distinguisher on Feistel Schemes
Block Ciphers Improved Meet-in-the-Middle Attack Efficient Tabulation Technique
2016/1/4
Improved meet-in-the-middle cryptanalysis with efficient tabulation technique has been shown to be a very powerful form of cryptanalysis against SPN block ciphers. However, few literatures show the ef...
A Meet in the Middle Attack on Reduced Round Kuznyechik
Kuznyechik Cryptanalysis Meet-in-the-middle attacks
2016/1/4
Kuznyechik is an SPN block cipher that has been recently chosen to be standardized by the Russian federation as a new GOST cipher. The algorithm updates a 128-bit state for nine rounds using a 256-bit...