Skip to search formSkip to main contentSkip to account menu

Meet-in-the-middle attack

Known as: MITM, Meet in the middle attack, Meet-in-the-middle 
The Meet-in-the-Middle attack (MITM) is a generic space–time tradeoff cryptographic attack.
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
3-subset meet-in-the-middle attackBaby-step giant-stepBiclique attackBirthday attack

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A Meet in the Middle Attack on Reduced Round Kuznyechik
Kuznyechik is an SPN block cipher that has been recently chosen to be standardized by the Russian federation as a new GOST cipher… 
Highly Cited
2014
Highly Cited
2014
A collaborative methodology for developing a semantic model for interlinking Cancer Chemoprevention linked-data sources
This paper proposes a collaborative methodology for developing semantic data models. The proposed methodology for the semantic… 
2014
2014
Match Box Meet-in-the-Middle Attack Against KATAN
Recent years have seen considerable interest in lightweight cryptography. One particular consequence is a renewed study of meet… 
2013
2013
Meet-in-the-Middle Attacks on Reduced-Round GOST
The block cipher GOST (GOST 28147-89) is a Russian standard for encryption and message authentication that is included in OpenSSL… 
2013
2013
Meet-in-the-Middle Attacks on AES
This thesis is dedicated to the cryptanalysis of the AES (Advanced Encryption Standard) which is one of the most widely deployed… 
2012
2012
A Meet-in-the-Middle Attack on Reduced-Round SNAKE(2)
SNAKE is a Feistel cipher proposed by Lee and Cha at JW-ISC 1997.It has two versions,i.e.SNAKE(1) and SNAKE(2).The security of… 
2011
2011
Meet-in-the-Middle Attacks on Reduced-Round XTEA
The block cipher XTEA, designed by Needham and Wheeler, was published as a technical report in 1997. The cipher was a result of… 
Highly Cited
2009
Highly Cited
2009
Improved Meet-in-the-Middle Attacks on AES
We improve the existing distinguishers of AES. Our work is mainly built upon the works by Gilbert& Miner [17] and Demirci… 
2007
2007
A Meet-in-the-Middle Collision Attack Against the New FORK-256
We show that a 2112.9 collision attack exists against the FORK-256 Hash Function. The attack is surprisingly simple compared to… 
Highly Cited
2000
Highly Cited
2000
Advances in Cryptology — CRYPTO ’85 Proceedings
Signatures and authentication.- Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields.- Another Birthday… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)