On the Performance Analysis of SPHINCS+ Verification
Summary :
SPHINCS+, an updated version of SPHINCS, is a post-quantum hash-based signature scheme submitted to the NIST post-quantum cryptography standardization project. To evaluate its performance, SPHINCS+ gives the theoretical number of function calls and the actual runtime of a reference implementation. We show that the theoretical number of function calls for SPHINCS+ verification is inconsistent with the runtime and then present the correct number of function calls.
- Publication
- IEICE TRANSACTIONS on Information Vol.E102-D No.12 pp.2603-2606
- Publication Date
- 2019/12/01
- Publicized
- 2019/09/20
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2019EDL8131
- Type of Manuscript
- LETTER
- Category
- Information Network
Authors
Tae Gu KANG
Myongji University
Jinwoo LEE
Myongji University
Junyeng KIM
Lotte Data Communication Co.
Dae Hyun YUM
Myongji University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tae Gu KANG, Jinwoo LEE, Junyeng KIM, Dae Hyun YUM, "On the Performance Analysis of SPHINCS+ Verification" in IEICE TRANSACTIONS on Information,
vol. E102-D, no. 12, pp. 2603-2606, December 2019, doi: 10.1587/transinf.2019EDL8131.
Abstract: SPHINCS+, an updated version of SPHINCS, is a post-quantum hash-based signature scheme submitted to the NIST post-quantum cryptography standardization project. To evaluate its performance, SPHINCS+ gives the theoretical number of function calls and the actual runtime of a reference implementation. We show that the theoretical number of function calls for SPHINCS+ verification is inconsistent with the runtime and then present the correct number of function calls.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2019EDL8131/_p
Copy
@ARTICLE{e102-d_12_2603,
author={Tae Gu KANG, Jinwoo LEE, Junyeng KIM, Dae Hyun YUM, },
journal={IEICE TRANSACTIONS on Information},
title={On the Performance Analysis of SPHINCS+ Verification},
year={2019},
volume={E102-D},
number={12},
pages={2603-2606},
abstract={SPHINCS+, an updated version of SPHINCS, is a post-quantum hash-based signature scheme submitted to the NIST post-quantum cryptography standardization project. To evaluate its performance, SPHINCS+ gives the theoretical number of function calls and the actual runtime of a reference implementation. We show that the theoretical number of function calls for SPHINCS+ verification is inconsistent with the runtime and then present the correct number of function calls.},
keywords={},
doi={10.1587/transinf.2019EDL8131},
ISSN={1745-1361},
month={December},}
Copy
TY - JOUR
TI - On the Performance Analysis of SPHINCS+ Verification
T2 - IEICE TRANSACTIONS on Information
SP - 2603
EP - 2606
AU - Tae Gu KANG
AU - Jinwoo LEE
AU - Junyeng KIM
AU - Dae Hyun YUM
PY - 2019
DO - 10.1587/transinf.2019EDL8131
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E102-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2019
AB - SPHINCS+, an updated version of SPHINCS, is a post-quantum hash-based signature scheme submitted to the NIST post-quantum cryptography standardization project. To evaluate its performance, SPHINCS+ gives the theoretical number of function calls and the actual runtime of a reference implementation. We show that the theoretical number of function calls for SPHINCS+ verification is inconsistent with the runtime and then present the correct number of function calls.
ER -
English
