English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We propose a variational quantum attack algorithm (VQAA) for classicalAES-like symmetric cryptography, as exemplified the simplified-data encryptionstandard (S-DES). In the VQAA, the known ciphertext is encoded as the groundstate of a Hamiltonian that is constructed through a regular graph, and theground state can be found using a variational approach. We designed the ansatzand cost function for the S-DES's variational quantum attack. It is surprisingthat sometimes the VQAA is even faster than Grove's algorithm as demonstratedby our simulation results. The relationships of the entanglement entropy,concurrence and the cost function are investigated, which indicate thatentanglement plays a crucial role in the speedup.

A Variational Quantum Attack for AES-like Symmetric Cryptography