Quantum algorithm to find invariant linear structure of MD hash functions
In this paper, we consider a special problem. “Given a function f : { 0 , 1 } n → { 0 , 1 } m . Suppose there exists a n -bit string α ∈ { 0 , 1 } n subject to f ( x ⊕ α ) = f ( x ) for ∀ x ∈ { 0 , 1 } n . We only know the Hamming weight W ( α ) = 1 , and find this α .” We present a quantum algorith...
Saved in:
Published in | Quantum information processing Vol. 14; no. 3; pp. 813 - 829 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Boston
Springer US
01.03.2015
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!