微信服务号

微信订阅号

2025-5-13- 1
Home > Archive>Volume 23, Issue 7, 2012 >1899-1907. DOI:10.3724/SP.J.1001.2012.04123
PDF HTML XML Export Cite reminder
Cryptographic Properties of BOMM
Author:
Affiliation:

  • Article
    • | |
  • Metrics
    • |
  • Reference [9]
    • |
  • Related
    • |
  • Cited by
    • | |
  • Comments
    Abstract:

    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.

    Reference
    [1] Zhang YA, Feng DG. Word-Oriented memorable logics in stream cipher design. Journal of Beijing University of Posts andTelecommunications, 2006,29(2):16-17 (in Chinese with English abstract).
    [2] Feng DG, Zhang YA. A sequence disruption algorithm featured in memorable logics wih single-byte operations. Int. Cl.: H04L9/00 China Patent 200510051171, 2005-03-02 (in Chinese).
    [3] Feng DG, Feng XT, Zhang WT, Fan XB, Wu CK. Loiss: A byte-oriented stream cipher. In: Chee YM, ed. Proc. of the IWCC.Berlin, Heidelberg: Springer-Verlag, 2011. 109-125.
    [4] Nicolas TC, Willi. M. Algebraic attacks on stream ciphers with linear feedback. In: Biham E, ed. Proc. of the EUROCRYPT 2003.LNCS 2656, Berlin Heidelberg: Springer-Verlag, 2003. 345-359.
    [5] Nicolas TC, Josef P. Cryptanalysis of block ciphers with overdefined systems of equations. In: Zheng YL, ed. Proc. of theAsiacrypt 2002. LNCS 2501, Berlin, Heidelberg: Springer-Verlag, 2002. 267-287. [doi: 10.1007/3-540-36178-2_17]
    [6] Willi M, Enes P, Claude C. Algebraic attacks and decomposition of Boolean functions. In: Cachin C, Camenisch J, eds. Proc. of theEUROCRYPT 2004. LNCS 3027, Berlin: Springer-Verlag, 2004. 474-491. [doi: 10.1007/978-3-540-24676-3_28]
    [7] Nicolas C, Alexander K, Jacques P, Shamir A. Efficient algorithms for solving overdefined systems of multivariate polynomialequations. In: Preneel B, ed. Proc. of the EUROCRYPT 2000. LNCS 1807, Berlin: Springer-Verlag, 2000. 392-407.
    [8] Claus D. The XL-algorithm and a conjecture from commutative algebra. In: Lee PJ, ed. Proc. of the ASIACRYPT 2004. LNCS3329, Berlin: Springer-Verlag, 2004. 323-337.
    [9] Fluhrer S, Mantin I, Shamir A. Weaknesses in the key scheduling algorithm of RC4. In: Vaudenay S, Youssef A, eds. Proc. of theSAC 2001. LNCS 2259, Berlin: Springer-Verlag, 2001. 1-24.
    Related
    Cited by
Get Citation

杨笑,范修斌,武传坤,余玉银,冯秀涛. BOMM 算法的密码学性质.软件学报,2012,23(7):1899-1907

Copy
Share
Article Metrics
  • Abstract:4565
  • PDF: 7932
  • HTML: 0
  • Cited by: 0
History
  • Received:October 20,2010
  • Revised:September 01,2011
  • Online: July 03,2012
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063