Fast construction of binary ring FCSRs for hardware stream ciphers

DOI10.1007/S10623-017-0370-4zbMath1391.14049OpenAlexW2619201850WikidataQ121308106 ScholiaQ121308106MaRDI QIDQ1741931

Xianqiang Yang

Publication date: 10 April 2018

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

Full work available at URL: https://doi.org/10.1007/s10623-017-0370-4

zbMATH Keywords

transition matrixstream cipherl-sequences2-adic ringFCSRs

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (1)

Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications

Cites Work

• Unnamed Item
• Breaking the stream ciphers F-FCSR-H and F-FCSR-16 in real time
• A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences
• A matrix approach for FCSR automata
• Linearity properties of binary FCSR sequences
• Feedback shift registers, 2-adic span, and combiners with memory
• An efficient state recovery attack on the X-FCSR family of stream ciphers
• Construction of Transition Matrices for Ternary Ring Feedback With Carry Shift Registers
• A New Approach for FCSRs
• 2-Adic shift registers
• Fibonacci and Galois representations of feedback-with-carry shift registers
• Revisiting LFSRs for Cryptographic Applications
• A Survey of Feedback with Carry Shift Registers
• Fast Software Encryption

This page was built for publication: Fast construction of binary ring FCSRs for hardware stream ciphers