LSI/VLSI testability design
A public-key cryptosystem based on shift register sequences
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Built-in test for VLSI: pseudorandom techniques
Built-in test for VLSI: pseudorandom techniques
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
The Design of Rijndael
The First Experimental Cryptanalysis of the Data Encryption Standard
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
LFSR Reseeding with Irreducible Polynomials
IOLTS '07 Proceedings of the 13th IEEE International On-Line Testing Symposium
On the design of error-correcting ciphers
EURASIP Journal on Wireless Communications and Networking
A matricial public key cryptosystem with digital signature
WSEAS Transactions on Mathematics
An optimized pseudorandom generator using packed matrices
WSEAS Transactions on Information Science and Applications
Audio watermark detection improvement by using noise modelling
MIV'05 Proceedings of the 5th WSEAS international conference on Multimedia, internet & video technologies
| Hi-index | 0.00 |
It all began in Colossus, with a code-breaking machine that was one of the first known examples of a shift register. During the ages, the shift registers demonstrated their capacity to be the heart of any digital system. Now the applications are well-known as well in cryptography (Rijndael Algorithm) as in error correcting and in wireless communication systems. This paper contains an analysis of functioning for Linear Feedback Shift Register and Multiple Input-output Shift Register using grade 4 irreducible polynomials. Three kinds of scheme for implementation of a LFSR were analyzed and a formula that linked the results was verified.