Improving linear cryptanalysis of LOKI91 by probabilistic counting method

DOI10.1007/BFb0052340zbMath1385.94069OpenAlexW1481428398MaRDI QIDQ4639334

Kouichi Sakurai, Souichi Furuya

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/bfb0052340

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

On quadratic approximations in block ciphers ⋮ Unnamed Item

Cites Work

• Advances in cryptology - AUSCRYPT '90. International conference on cryptology, Sydney, Australia, January 8-10, 1990. Proceedings
• Provable security against a differential attack
• Non-Linear Approximations in Linear Cryptanalysis
• Counting large numbers of events in small registers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improving linear cryptanalysis of LOKI91 by probabilistic counting method