BOMM(byte-orientedmemorialmixer)算法是一种基于字节操作的混合型带记忆的序列扰乱算法,因具备良好的密码学性质,一个新的流密码算法Loiss使用了它作为主要组件.建立了BOMM算法的5次代数方程系统,在此基础上讨论了针对Loiss算法的代数攻击的复杂度.此外还发现了BOMM算法的一个统计弱点,并分析了Loiss算法在一类弱密钥下的安全性.
BOMM is a byte-oriented mixed type algorithm with memory, which is used to disorder a given byte sequence. It has been used as a main component in a new stream cipher called Loiss for having many good cryptographic properties. This paper builds an algebraic equation system with degree 5 for BOMM, and based on this equation system, discusses the complexity of algebraic attack on Loiss. In addition, the paper also discusses the statistic weakness of BOMM and gives an analysis of the security of Loiss under a specific class of weak keys.