• DocumentCode
    2618189
  • Title

    Ambiguity of integer sequences and application

  • Author

    Bournon, LoÏC

  • Author_Institution
    Toulon Univ., La Garde, France
  • fYear
    1994
  • fDate
    27 Jun-1 Jul 1994
  • Firstpage
    369
  • Abstract
    We present an algorithm which solves in polynomial time the problem of the ambiguity of integer sequences. This is done by introducing a suitable transformation from F2n to {-1,0,1}n and by the search of a short vector in a reduced lattice according to the L3 algorithm. The algorithm presented shows that the Damgard (1989) hash function is insecure
  • Keywords
    computational complexity; cryptography; operations research; polynomials; search problems; sequences; algorithm; ambiguity; hash function; integer sequences; knapsack; polynomial time; reduced lattice; short vector search; Approximation algorithms; Cryptography; Lattices; Polynomials; Reactive power;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
  • Conference_Location
    Trondheim
  • Print_ISBN
    0-7803-2015-8
  • Type

    conf

  • DOI
    10.1109/ISIT.1994.394649
  • Filename
    394649
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2618189