Algebraic Cryptanalysis of Small-Scale Variants of the Bluetooth Stream Cipher E0
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F25%3A00386755" target="_blank" >RIV/68407700:21240/25:00386755 - isvavai.cz</a>
Result on the web
<a href="https://ieeexplore.ieee.org/document/11272585" target="_blank" >https://ieeexplore.ieee.org/document/11272585</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/DSD67783.2025.00038" target="_blank" >10.1109/DSD67783.2025.00038</a>
Alternative languages
Result language
angličtina
Original language name
Algebraic Cryptanalysis of Small-Scale Variants of the Bluetooth Stream Cipher E0
Original language description
E0 encryption is primarily used in Bluetooth devices to ensure secure communication, and it is also integrated into various IoT devices for secure data transmission. Small-scale variants of E0 are explored for optimizing performance and security in devices with limited computational resources. This study explores the algebraic cryptanalysis of small-scale variants of the E0 stream cipher, a legacy cipher used in the Bluetooth protocol. By systematically reducing the size of the linear feedback shift registers (LFSRs) while preserving the cipher’s core structure, we investigate the relationship between the number of unknowns and the number of consecutive keystream bits required to recover the internal states of the LFSRs. Our work demonstrates an approximately linear relationship between the number of consecutive keystream bits and the size of small-scale E0 variants, as indicated by our experimental results. To this end, we utilize two approaches: the computation of Gröbner bases using Magma’s F4 algorithm and the application of CryptoMiniSat’s SAT solver. Our experimental results show that increasing the number of keystream bits significantly improves computational efficiency, with the F4 algorithm achieving a speedup of up to 733x when additional equations are supplied. Furthermore, we verify the non-existence of equations of degree four or lower for up to seven consecutive keystream bits, and the non-existence of equations of degree three or lower for up to eight consecutive keystream bits, extending prior results on the algebraic properties of E0.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 2025 28th Euromicro Conference on Digital System Design
ISBN
979-8-3315-8499-3
ISSN
2639-3859
e-ISSN
2771-2508
Number of pages
8
Pages from-to
198-205
Publisher name
IEEE Computer Society
Place of publication
Los Alamitos
Event location
Salerno
Event date
Sep 10, 2025
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
001717790400026