Special Section on Discrete Mathematics and Its Applications
On Searching Linear Transformations for the Register R of MICKEY-Family Ciphers
2018 Volume E101.A Issue 9 Pages 1546-1547
Details
2018 Volume E101.A Issue 9 Pages 1546-1547
MICKEY-family ciphers are lightweight cryptographic primitives and include a register R determined by two related maximal-period linear transformations. Provided that primitivity is efficiently decided in finite fields, it is shown by quantitative analysis that potential parameters for R can be found in probabilistic polynomial time.