Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Multi-Collision Distinguishers.

Zhenzhen Bao, Jian Guo, Shun Li, Phuong Pham

Published Jan 1, 2021• 3 citations
OpenAlex

Related papers

On Finding Quantum Multi-collisions

Qipeng Liu, Mark Zhandry

Lecture notes in computer science•Jan 1, 2019•42 citations

Automatic Quantum Multi-collision Distinguishers and Rebound Attacks with Triangulation Algorithm

Zhenzhen Bao, Jian Guo, Shun Li +1 more

Lecture notes in computer science•Jan 1, 2024•3 citations

Quantum Collision Course

Science•Sep 5, 2013•0 citations

Generating Mesoscopic Bell States via Collisions of Distinguishable Quantum Bright Solitons

Bettina Gertjerenken, T. P. Billam, Caroline L. Blackley +4 more

We investigate numerically the collisions of two distinguishable quantum matter-wave bright solitons in a one-dimensional harmonic trap. We show that such collisions can be used to generate mesoscopic Bell states that can reliably be distinguished from statistical mixtures. Calculation of the relevant s-wave scattering lengths predicts that such states could potentially be realized in quantum-degenerate mixtures of 85Rb and 133Cs. In addition to fully quantum simulations for two distinguishable two-particle solitons, we use a mean-field description supplemented by a stochastic treatment of quantum fluctuations in the soliton's center of mass: we demonstrate the validity of this approach by comparison to a mathematically rigorous effective potential treatment of the quantum many-particle problem.

arXiv:1301.0718•Physical Review Letters•Sep 6, 2013•49 citations

Quantum Interaction

Harald Atmanspacher A, Thomas Filk A, Emmanuel M. Pothos

Lecture notes in computer science•Jan 1, 2016•6 citations

Quantum Differential Collision Distinguishing Attacks on Feistel Schemes

ZHANG Zhongya, Wenling Wu, WANG Bolin

Feistel schemes are important components of symmetric ciphers, which have been extensively studied in the classical setting. We examine the extension methods of differential distinguishers of Feistel key-function and Feistel function-key schemes. The schemes are subjected to quantum differential collision distinguishing attacks based on the methods. The results show that the complexity is lower than that of differential attacks using only Grover algorithm, and the complexity of differential collision attack based on the Brassard-Høyer-Tapp and Grover algorithms is lower than that of quantization when using only the Grover algorithm. The results also show that different algorithms and methods can be combined to produce a more effective cryptanalysis approach. This provides a research direction for post-quantum cryptographic analysis and design.

Chinese Journal of Electronics•Nov 1, 2021•3 citations
We investigate numerically the collisions of two distinguishable quantum matter-wave bright solitons in a one-dimensional harmonic trap. We show that such collisions can be used to generate mesoscopic Bell states that can reliably be distinguished from statistical mixtures. Calculation of the relevant s-wave scattering lengths predicts that such states could potentially be realized in quantum-degenerate mixtures of 85Rb and 133Cs. In addition to fully quantum simulations for two distinguishable two-particle solitons, we use a mean-field description supplemented by a stochastic treatment of quantum fluctuations in the soliton's center of mass: we demonstrate the validity of this approach by comparison to a mathematically rigorous effective potential treatment of the quantum many-particle problem.
Feistel schemes are important components of symmetric ciphers, which have been extensively studied in the classical setting. We examine the extension methods of differential distinguishers of Feistel key-function and Feistel function-key schemes. The schemes are subjected to quantum differential collision distinguishing attacks based on the methods. The results show that the complexity is lower than that of differential attacks using only Grover algorithm, and the complexity of differential collision attack based on the Brassard-Høyer-Tapp and Grover algorithms is lower than that of quantization when using only the Grover algorithm. The results also show that different algorithms and methods can be combined to produce a more effective cryptanalysis approach. This provides a research direction for post-quantum cryptographic analysis and design.