On Searching Linear Transformations for the Register R of MICKEY-Family Ciphers
发布时间：2025-03-31
点击次数：
- DOI码：
- 10.1587/transfun.E101.A.1546
- 发表刊物：
- IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- 关键字：
- MICKEY cipher, linear transformation, maximal period, finite field, primitive element
- 摘要：
- 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.
- 合写作者：
- Ying GAO, Yu ZHOU, Xiaoni DU
- 第一作者：
- Lin WANG
- 论文类型：
- 期刊论文
- 卷号：
- E101.A
- 期号：
- 9
- 页面范围：
- 1546-1547
- ISSN号：
- 0916-8508
- 是否译文：
- 否
- 发表时间：
- 2018-09-01
