Automatic Search for Key-Bridging Technique: Applications to LBlock and TWINE
From MaRDI portal
Publication:4639481
DOI10.1007/978-3-662-52993-5_13zbMATH Open1387.94089OpenAlexW2489581735MaRDI QIDQ4639481FDOQ4639481
Authors: Li Lin, Wenling Wu, Yafei Zheng
Publication date: 9 May 2018
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-52993-5_13
Recommendations
- Automatic search for the best trails in ARX: application to block cipher \textsc{Speck}
- Automatic search for related-key differential characteristics in byte-oriented block ciphers: application to AES, Camellia, Khazad and others
- Automatic security evaluation and (related-key) differential characteristic search: application to SIMON, PRESENT, Lblock, DES(L) and other bit-oriented block ciphers
- Automatic Search for Related-Key Differential Trails in SIMON-like Block Ciphers Based on MILP
- Automatic search of truncated impossible differentials for word-oriented block ciphers
- Automatic Search for Differential Trails in ARX Ciphers
block ciphersLBlockTWINEzero-correlation linear cryptanalysisimpossible differential cryptanalysisautomatic searchkey-bridging technique
Cites Work
- LBlock: a lightweight block cipher
- $\textnormal{\textsc{TWINE}}$: A Lightweight Block Cipher for Multiple Platforms
- Title not available (Why is that?)
- PRESENT: An Ultra-Lightweight Block Cipher
- PRINTcipher: A Block Cipher for IC-Printing
- Distinguisher and Related-Key Attack on the Full AES-256
- The LED block cipher
- Improved single-key attacks on 8-round AES-192 and AES-256
- A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
- HIGHT: A New Block Cipher Suitable for Low-Resource Device
- Fast Software Encryption
- Scrutinizing and improving impossible differential attacks: applications to CLEFIA, Camellia, Lblock and Simon
- The \textsc{Simon} and \textsc{Speck} block ciphers on AVR 8-bit microcontrollers
- Links among impossible differential, integral and zero correlation linear cryptanalysis
- Impossible differential attack on reduced-round TWINE
- Speeding up Collision Search for Byte-Oriented Hash Functions
- Improved multidimensional zero-correlation linear cryptanalysis and applications to lblock and TWINE
- Differential analysis and meet-in-the-middle attack against round-reduced TWINE
- Automatic search of truncated impossible differentials for word-oriented block ciphers
- Improved single-key attacks on 9-round AES-192/256
- General model of the single-key meet-in-the-middle distinguisher on the word-oriented block cipher
- Improved key recovery attacks on reduced-round AES in the single-key setting
- Meet-in-the-middle attacks on 10-round AES-256
Cited In (3)
Uses Software
This page was built for publication: Automatic Search for Key-Bridging Technique: Applications to LBlock and TWINE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639481)