Algorithms for the Minimal Rational Fraction Representation of Sequences Revisited

Given a binary sequence with length <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula>, determining its minimal rational fraction representation (MRFR) has important applications in the design and cryptanalysis of stream ciphers. There are ma...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 68; no. 2; pp. 1316 - 1328
Main Authors:	Che, Jun, Tian, Chengliang, Jiang, Yupeng, Xu, Guangwu
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.02.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Adaptive algorithms Algorithms Approximation algorithms Ciphers Complexity Complexity theory Cryptography Encryption extended euclidean algorithm lattice Lattices minimal basis rational fraction representation Representations Sequence Terminology Time complexity
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!