Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

IACR
2011

favoriteEmaildiscussreport

243views more IACR 2011»

Guess-then-Meet-in-the-Middle Attacks on the KTANTAN Family of Block Ciphers

12 years 4 months ago

Guess-then-Meet-in-the-Middle Attacks on the KTANTAN Family of Block Ciphers

Download eprint.iacr.org

The block cipher family for lightweight devices, KTANTAN, is analyzed in this paper. We propose a new cryptanalysis method which improves results of Meet-in-the-Middle attacks on KTANTAN. We show KTANTAN32/48/64 can be broken by using this new method in time complexities of 268.06 , 270.92 and 273.09 in terms of full-round KTANTANn encryptions respectively, which are better than the previous analysis results with complexities of 272.93 , 273.43 and 274.38 .

Bo Zhu, Guang Gong

Real-time Traffic

Block Cipher | Cryptanalysis | IACR 2011 | Time Complexities |

claim paper

Related Content

» Improved MeetintheMiddle Cryptanalysis of KTANTAN

» Some Instant and PracticalTime RelatedKey Attacks on KTANTAN324864

» KATAN and KTANTAN A Family of Small and Efficient HardwareOriented Block Ciphers

» Linear Cryptanalysis of ReducedRound Versions of the SAFER Block Cipher Family

» A Family of Trapdoor Ciphers

» Algebraic AIDACube and Side Channel Analysis of KATAN Family of Block Ciphers

» Algebraic Cryptanalysis of Curry and Flurry Using Correlated Messages

» Pseudorandom Permutation Families over Abelian Groups

» Improved Characteristics for Differential Cryptanalysis of Hash Functions Based on Block C...

Post Info
More Details (n/a)

Added	23 Dec 2011
Updated	23 Dec 2011
Type	Journal
Year	2011
Where	IACR
Authors	Bo Zhu, Guang Gong

Comments (0)