A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences

DOI10.1007/S10623-013-9845-0zbMath1351.94070OpenAlexW1984434872WikidataQ62041906 ScholiaQ62041906MaRDI QIDQ488250

Paul Stankovski, Thomas Johansson, Hui Wang

Publication date: 23 January 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-013-9845-0

zbMATH Keywords

linear relationsdistinguisherFeedback with carry shift registers (FCSRs)generalized birthday attack

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Fast construction of binary ring FCSRs for hardware stream ciphers ⋮ Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications

Uses Software

• eSTREAM

Cites Work

• Breaking the stream ciphers F-FCSR-H and F-FCSR-16 in real time
• A matrix approach for FCSR automata
• Linearity properties of binary FCSR sequences
• An overview of distinguishing attacks on stream ciphers
• Feedback shift registers, 2-adic span, and combiners with memory
• A New Approach for FCSRs
• Arithmetic crosscorrelations of feedback with carry shift register sequences
• 2-Adic shift registers
• Fibonacci and Galois representations of feedback-with-carry shift registers
• Cuckoo hashing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences