Automatic Search for Key-Bridging Technique: Applications to LBlock and TWINE

DOI10.1007/978-3-662-52993-5_13MaRDI QIDQ4639481zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

block ciphersLBlockTWINEzero-correlation linear cryptanalysisimpossible differential cryptanalysisautomatic searchkey-bridging technique

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

• scientific article; zbMATH DE number 1682693 (Why is no real title available?)
• $\textnormal{\textsc{TWINE}}$: A Lightweight Block Cipher for Multiple Platforms
• A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
• Automatic search of truncated impossible differentials for word-oriented block ciphers
• Differential analysis and meet-in-the-middle attack against round-reduced TWINE
• Distinguisher and Related-Key Attack on the Full AES-256
• Fast Software Encryption
• General model of the single-key meet-in-the-middle distinguisher on the word-oriented block cipher
• HIGHT: A New Block Cipher Suitable for Low-Resource Device
• Impossible differential attack on reduced-round TWINE
• Improved key recovery attacks on reduced-round AES in the single-key setting
• Improved multidimensional zero-correlation linear cryptanalysis and applications to lblock and TWINE
• Improved single-key attacks on 8-round AES-192 and AES-256
• Improved single-key attacks on 9-round AES-192/256
• LBlock: a lightweight block cipher
• Links among impossible differential, integral and zero correlation linear cryptanalysis
• Meet-in-the-middle attacks on 10-round AES-256
• PRESENT: An Ultra-Lightweight Block Cipher
• PRINTcipher: A Block Cipher for IC-Printing
• Scrutinizing and improving impossible differential attacks: applications to CLEFIA, Camellia, Lblock and Simon
• Speeding up Collision Search for Byte-Oriented Hash Functions
• The LED block cipher
• The \textsc{Simon} and \textsc{Speck} block ciphers on AVR 8-bit microcontrollers

Cited in

(3)

• On the key schedule of lightweight block ciphers
• Automatic Demirci-Selçuk meet-in-the-middle attack on SKINNY with key-bridging
• Block cipher invariants as eigenvectors of correlation matrices

Describes a project that uses

Uses Software

• CLEFIA
• LBlock
• PRESENT
• HIGHT
• TWINE
• SIMECK
• SIMON
• KTANTAN

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)