A number theoretic view on binary shift registers

DOI10.1007/s12095-022-00562-xzbMath1501.94021OpenAlexW4224323150WikidataQ114849160 ScholiaQ114849160MaRDI QIDQ2088954

George Petrides

Publication date: 6 October 2022

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-022-00562-x

zbMATH Keywords

shift registersadjacency graphPCRCCRCSRPSR

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Congruences; primitive roots; residue systems (11A07)

Related Items (1)

On decompositions of permutation polynomials into quadratic and cubic power permutations

Cites Work

• Unnamed Item
• On the cycles and adjacencies in the complementary circulating register
• A proof of Golomb's conjecture for the de Bruijn graph
• Non-Linear Recursive Sequences
• An efficient algorithm for the generation of DeBruijn cycles
• Shift Register Sequences – A Retrospective Account
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
• Higher-Order Masking Schemes for S-Boxes
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
• Double Adjacencies Between Cycles of a Circulating Shift Register

This page was built for publication: A number theoretic view on binary shift registers