For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
On Searching Linear Transformations for the Register R of MICKEY-Family Ciphers
Lin WANG Ying GAO Yu ZHOU Xiaoni DU
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2018/09/01
Online ISSN: 1745-1337
Type of Manuscript: Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
MICKEY cipher, linear transformation, maximal period, finite field, primitive element,
Full Text: PDF(273.3KB)
>>Buy this Article
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.