Design Strategies for ARX with Provable Bounds: Sparx and LAX
- Submitting institution
-
University of Edinburgh
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 82344715
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-662-53887-6_18
- Title of conference / published proceedings
- Advances in Cryptology -- ASIACRYPT 2016
- First page
- 484
- Volume
- 10031
- Issue
- -
- ISSN
- 0302-9743
- Open access status
- Deposit exception
- Month of publication
- November
- Year of publication
- 2016
- 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
-
5
- Research group(s)
-
C - Foundations of Computation
- Citation count
- 31
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The proposed design strategy has been applied to design family of lightweight cryptographic algorithms -- SPARKLE -- considered for standardisation by the National Institute of Standards and Technology (NIST), US. This was a response to call for lightweight cryptographic standards dated 27/08/2018 by NIST with results to be announced by December 2020. Paper proposes for the first time rigorous framework for the design of ARX ciphers. It was applied in the new lightweight ciphers TRAX and CRAX [Beierle et al., CRYPTO 2020]. Paper published in one of the top quality venues on cryptography -- Advances in Cryptology -- ASIACRYPT 2016.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -