Counting and characterising functions with “fast points” for differential attacks
- Submitting institution
-
Loughborough University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1938
- Type
- D - Journal article
- DOI
-
10.1007/s12095-015-0166-1
- Title of journal
- Cryptography and Communications
- Article number
- -
- First page
- 217
- Volume
- 9
- Issue
- 2
- ISSN
- 1936-2447
- Open access status
- Out of scope for open access requirements
- Month of publication
- November
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper has impacted the state of the art through enabling the quantification of the probability of success of the well-known cube/AIDA attacks on symmetric cryptography algorithms. The sequence computed in this paper was accepted and published by OEIS (Online Encyclopedia of Integer Sequences) as sequence A316554. Computing these numbers was an open problem of Duan and Lai. It has led to a joint project with Prof Ozbudak (Royal Society Newton Mobility Grant NI170158).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -