Fast Software Encryption

DOI10.1007/b137506zbMath1140.68381OpenAlexW4214882369WikidataQ28000487 ScholiaQ28000487MaRDI QIDQ5473581

François Arnault, Thierry P. Berger

Publication date: 22 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b137506

zbMATH Keywords

pseudorandom generatorstream cipherfeedback with carry shift register2-adic fractions

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Data encryption (aspects in computer science) (68P25) Theory of software (68N99)

Related Items (14)

Statistical properties of half-\(\ell\)-sequences ⋮ Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\) ⋮ Entropy of the Internal State of an FCSR in Galois Representation ⋮ Breaking the stream ciphers F-FCSR-H and F-FCSR-16 in real time ⋮ An efficient state recovery attack on the X-FCSR family of stream ciphers ⋮ A matrix approach for FCSR automata ⋮ FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\) ⋮ 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 ⋮ Breaking the F-FCSR-H Stream Cipher in Real Time ⋮ Parallel Generation of ℓ-Sequences ⋮ Linearity properties of binary FCSR sequences ⋮ X-FCSR – A New Software Oriented Stream Cipher Based Upon FCSRs ⋮ Autocorrelations of \(l\)-sequences with prime connection integer

This page was built for publication: Fast Software Encryption