Deciding Irreducibility/Indecomposability of Feedback Shift Registers Is NP-Hard
Feedback shift registers (FSRs) are used as a fundamental component in electronics and confidential communication. A FSR f is said to be reducible if all the output sequences of another FSR g can also be generated by f and the FSR g costs less memory than f. A FSR is said to be decomposable if it ha...
Saved in:
| Main Author: | Lin Wang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | IET Information Security |
| Online Access: | http://dx.doi.org/10.1049/2024/3219604 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
DESIGNING CONFIGURABLE SHIFT REGISTER WITH A LINEAR FEEDBACK
by: A. A. Ivaniuk
Published: (2016-10-01) -
ON A DYNAMIC GAME PROBLEM WITH AN INDECOMPOSABLE SET OF DISTURBANCES
by: Dmitriy A. Serkov
Published: (2019-12-01) -
Irreducibility of a Polynomial Shifted by a Power of Another Polynomial
by: Artūras Dubickas
Published: (2020-01-01) -
Irreducible basilar invagination and atlanto-axial dislocation: Are they really “irreducible”?
by: P. Sarat Chandra
Published: (2012-07-01) -
On the idempotent and nilpotent sum numbers of matrices over certain indecomposable rings and related concepts
by: P.V. Danchev
Published: (2021-03-01)