Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

Quantum cryptanalysis of hash and claw-free functions

Published: 01 June 1997 Publication History

Abstract

In this note, we give a quantum algorithm that finds collisions in arbitrary τ-to-one functions after only O(3√N/τ) expected evaluations of the function. Assuming the function is given by a black box, this is more efficient than the best possible classical algorithm, even allowing probabilism. We also give a similar algorithm for finding claws in pairs of functions. Furthermore, we exhibit a space-time tradeoff for our technique. Our approach uses Grover's quantum searching algorithm in a novel way.

Cited By

View all
  • (2024)Quantum related-key differential cryptanalysisQuantum Information Processing10.1007/s11128-024-04472-023:7Online publication date: 10-Jul-2024
  • (2023)Quantum Random Access Memory for DummiesSensors10.3390/s2317746223:17(7462)Online publication date: 28-Aug-2023
  • (2023)Kvantovyy algoritm invariantnoy otsenki blizosti klassicheskikh shifrov k odnorazovomu bloknotuПисьма в Журнал экспериментальной и теоретической физики10.31857/S1234567823010123117:1-2 (1)(80-88)Online publication date: 15-Jan-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGACT News
ACM SIGACT News  Volume 28, Issue 2
June 1997
70 pages
ISSN:0163-5700
DOI:10.1145/261342
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1997
Published in SIGACT Volume 28, Issue 2

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)252
  • Downloads (Last 6 weeks)28
Reflects downloads up to 30 Aug 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Quantum related-key differential cryptanalysisQuantum Information Processing10.1007/s11128-024-04472-023:7Online publication date: 10-Jul-2024
  • (2023)Quantum Random Access Memory for DummiesSensors10.3390/s2317746223:17(7462)Online publication date: 28-Aug-2023
  • (2023)Kvantovyy algoritm invariantnoy otsenki blizosti klassicheskikh shifrov k odnorazovomu bloknotuПисьма в Журнал экспериментальной и теоретической физики10.31857/S1234567823010123117:1-2 (1)(80-88)Online publication date: 15-Jan-2023
  • (2023)On post-quantum security of symmetric cryptosystems共通鍵暗号技術のポスト量子安全性についてIEICE ESS Fundamentals Review10.1587/essfr.17.1_5917:1(59-71)Online publication date: 1-Jul-2023
  • (2023)Multidimensional Quantum WalksProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585158(1125-1130)Online publication date: 2-Jun-2023
  • (2023)Quantum Algorithm for the Invariant Estimate of the Closeness of Classical Ciphers to the One-Time PadJETP Letters10.1134/S0021364022602846117:1(75-82)Online publication date: 14-Mar-2023
  • (2023)Non-Boolean quantum amplitude amplification and quantum mean estimationQuantum Information Processing10.1007/s11128-023-04146-322:12Online publication date: 30-Nov-2023
  • (2023)Quantum key recovery attacks on tweakable Even–Mansour ciphersQuantum Information Processing10.1007/s11128-023-04098-822:9Online publication date: 4-Sep-2023
  • (2023)Distributed LedgerDistributed Systems10.1002/9781119825968.ch17(461-490)Online publication date: 10-Feb-2023
  • (2022)A Rapid Computing Technology on Profound Computing Era with Quantum ComputingRising Threats in Expert Applications and Solutions10.1007/978-981-19-1122-4_58(559-565)Online publication date: 4-Jul-2022
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media