Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (Q1993901)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6973439
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 |
scientific article; zbMATH DE number 6973439 |
Statements
Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (English)
0 references
5 November 2018
0 references
quantum circuit
0 references
Grover
0 references
parallelization
0 references
resource estimates
0 references
AES
0 references
SHA-2
0 references
0 references
0.7956823110580444
0 references
0.7935763597488403
0 references
0.7768554091453552
0 references
0.7758737802505493
0 references
0.7544772624969482
0 references
