Revisit two memoryless state‐recovery cryptanalysis methods on A5/1
Abstract At ASIACRYPT 2019, Zhang proposed a near collision attack on A5/1 claiming to recover the 64‐bit A5/1 state with a time complexity around 232 cipher ticks with negligible memory requirements. Soon after its proposal, Zhang's near collision attack was severely challenged by Derbez et al...
Saved in:
Main Authors: | Yanbin Xu, Yonglin Hao, Mingxing Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2023-07-01
|
Series: | IET Information Security |
Subjects: | |
Online Access: | https://doi.org/10.1049/ise2.12120 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Saturation cryptanalysis of CLEFIA
by: WANG Wei1, et al.
Published: (2008-01-01) -
Cryptanalysis of an efficient group signature schemen
by: LU Rong-bo1, et al.
Published: (2007-01-01) -
Strengthened 32‐bit AES implementation: Architectural error correction configuration with a new voting scheme
by: Saeideh Sheikhpur, et al.
Published: (2021-11-01) -
Cryptanalysis of Loiss Stream Cipher-Revisited
by: Lin Ding, et al.
Published: (2014-01-01) -
Two new color (n, n)-secret sharing schemes
by: YI Feng, et al.
Published: (2007-01-01)