Modern Cryptanalysis
Modern CryptanalysisTechniques
-
LFSRs and the Berlekamp–Massey Algorithm
This page will try to explain Linear Feedback Shift Registers (LFSRs) and how to generate a minimal length LFSR given a bitstream.
This page will try to explain Linear Feedback Shift Registers (LFSRs) and how to generate a minimal length LFSR given a bitstream.
Copyright James Lyons © 2009-2012
No reproduction without permission.
Notice a problem? We'd like to fix it!
Leave a comment on the page and we'll take a look.
Sitemap