• DocumentCode
    2106927
  • Title

    Probability analysis and application of XOR difference between (X+K)mod2n and X⊕K

  • Author

    Guan, Jie ; Ding, Lin

  • Author_Institution
    Zhengzhou Inf. Sci. Technol. Inst., Zhengzhou, China
  • fYear
    2010
  • fDate
    17-19 Dec. 2010
  • Firstpage
    375
  • Lastpage
    378
  • Abstract
    Based on the “larger probability is priory to pick up” principle in savage attack, the best algorithm with computational complexity of O(n) is given to solve the equivalent problem of (X+K)mod2n and X ⊕ K, which improving the Guess and Determine attack on SNOW1.0 of Hawkes, the data complexity of our attack decrease to 1/32 of Hawkes´s and the computational complexity keeps the same as before.
  • Keywords
    computational complexity; cryptography; probability; XOR difference; computational complexity; data complexity; probability analysis; Algorithm design and analysis; Computational complexity; Cryptography; Information science; Registers; Snow; Guess and Determine attack; SNOW; XOR Difference; addition on module 2n;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory and Information Security (ICITIS), 2010 IEEE International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-6942-0
  • Type

    conf

  • DOI
    10.1109/ICITIS.2010.5689595
  • Filename
    5689595
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2106927