### Loiss: A Byte-Oriented Stream Cipher

Dengguo Feng, Xiutao Feng, Wentao Zhang, Xiubin Fan, and Chuankun Wu

##### Abstract

This paper presents a byte-oriented stream cipher -- Loiss, which takes a 128-bit initial key and a 128-bit initial vector as inputs, and outputs a key stream of bytes. The algorithm is based on a linear feedback shift register, and uses a structure called BOMM in the filter generator, which has good property on resisting against algebraic attacks, linear distinguishing attacks and fast correlation attacks. In order for BOMM to be balanced, the S-boxes in BOMM must be orthomorphic permutations. To further improve the capability in resisting against those attacks, the S-boxes in BOMM must also possess some good cryptographic properties, for example, high algebraic immunity, high nonlinearity, and so on. However current researches on orthomorphic permutations pay little attention on their cryptographic properties, and we believe that Loiss not only enriches applications of orthomorphic permutations in cryptography, but also motivates the research on a variety of cryptographic properties of orthomorphic permutations.

Note: Minor corrections.

Available format(s)
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
stream ciphersLoissBOMMorthomorphic permutations
Contact author(s)
fengxt @ gmail com
fengxt @ is iscas ac cn
History
2010-09-19: revised
See all versions
Short URL
https://ia.cr/2010/489

CC BY

BibTeX

@misc{cryptoeprint:2010/489,
author = {Dengguo Feng and Xiutao Feng and Wentao Zhang and Xiubin Fan and Chuankun Wu},
title = {Loiss: A Byte-Oriented Stream Cipher},
howpublished = {Cryptology ePrint Archive, Paper 2010/489},
year = {2010},
note = {\url{https://eprint.iacr.org/2010/489}},
url = {https://eprint.iacr.org/2010/489}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.