IEICE TRANSACTIONS on Fundamentals
On Searching Linear Transformations for the Register R of MICKEY-Family Ciphers
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E101-A No.9 pp.1546-1547
- Publication Date
- 2018/09/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E101.A.1546
- Type of Manuscript
- Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Lin WANG
Science and Technology on Communication Security Laboratory
Ying GAO
Beihang University
Yu ZHOU
Science and Technology on Communication Security Laboratory
Xiaoni DU
Northwest Normal University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Lin WANG, Ying GAO, Yu ZHOU, Xiaoni DU, "On Searching Linear Transformations for the Register R of MICKEY-Family Ciphers" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 9, pp. 1546-1547, September 2018, doi: 10.1587/transfun.E101.A.1546.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.1546/_p
Copy
@ARTICLE{e101-a_9_1546,
author={Lin WANG, Ying GAO, Yu ZHOU, Xiaoni DU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Searching Linear Transformations for the Register R of MICKEY-Family Ciphers},
year={2018},
volume={E101-A},
number={9},
pages={1546-1547},
abstract={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.},
keywords={},
doi={10.1587/transfun.E101.A.1546},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - On Searching Linear Transformations for the Register R of MICKEY-Family Ciphers
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1546
EP - 1547
AU - Lin WANG
AU - Ying GAO
AU - Yu ZHOU
AU - Xiaoni DU
PY - 2018
DO - 10.1587/transfun.E101.A.1546
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2018
AB - 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.
ER -
English
