资 源 简 介
This Mathematica package provides a symbolic representation of Linear Feedback Shift Registers, often used in cryptography. With this package, you can generate bit sequences from LFSRs, and from bit sequences determine the minimal generating LFSR along with the linear complexity profile using the Berlekamp-Massey Algorithm.
Linear Feedback Shift Registers (LFSR) are primarly used in cryptography and random number testing. More information on them can be found in Applied Cryptography or Handbook of Applied Cryptography. More on the Berlekamp-Massey algorithm can be found at MathWorld.
Examples
LFSR[complexity, polynomial] is an abstract Linear Feedback Shift Register. By itself it doesn"t do anything.
``<