The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
ESFINHAS+, uma versão atualizada do SPHINCS, é um esquema de assinatura baseado em hash pós-quântico submetido ao projeto de padronização de criptografia pós-quântica do NIST. Para avaliar seu desempenho, o SPHINCS+ fornece o número teórico de chamadas de função e o tempo de execução real de uma implementação de referência. Mostramos que o número teórico de chamadas de função para SPHINCS+ a verificação é inconsistente com o tempo de execução e, em seguida, apresenta o número correto de chamadas de função.
Tae Gu KANG
Myongji University
Jinwoo LEE
Myongji University
Junyeng KIM
Lotte Data Communication Co.
Dae Hyun YUM
Myongji University
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.
Copiar
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
Copiar
@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},}
Copiar
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 -