HORST數位簽章方案之改進

An improvement on HORST signature scheme

周彥儒(Yen-Ju Chou)

指導教授 ： 陳榮傑

國立交通大學/資訊學院/資訊科學與工程研究所/碩士(2019年)

摘要

2015 年，Bernstein 等密碼學專家提出了 SPHINCS 數位簽章方案，SPHINCS是第一個基於雜湊函數的無狀態數位簽章方案，而他的改良版本SPHINCS+ 被認為非常有機會作為後量子密碼時代的數位簽章標準。
在此篇論文中，我們針對 SPHINCS 中的重要成分—HORST簽章，提出了幾種可能的改進。我們設計了兩種算法分別用來消除重疊的驗證路徑以及產生完全相異的密鑰元素，幫助減少簽章大小、提升安全性。

關鍵字

量子計算 ； 後量子密碼學 ； 基於雜湊函數之數位簽章

並列摘要

In 2015, the SPHINCS signature scheme was proposed by Daniel J Bernstein et al.. It was the first stateless hash-based signature scheme and its imrpoved version SPHINCS+ was a promising candidate for post-quantum signature standardization. In this thesis, we propose some possible improvements on HORST signature scheme, an important component in SPHINCS. We design a bottom-up algorithm to remove the overlapping authentication paths and an algorithm to generate distinct secret key elements which can help saving the signature size and enhancing the security.

並列關鍵字

Quantum computing ； Post-quantum cryptography ； Hash-based signature schemes ； SHPINCS

參考文獻

[1] Ronald L Rivest, Adi Shamir, and Leonard Adleman. “A method for obtaining digital signatures and public-key cryptosystems”. In: Communications of the ACM 21.2 (1978), pp. 120–126.

[2] Neal Koblitz. “Elliptic curve cryptosystems”. In: Mathematics of computation 48.177 (1987), pp. 203–209.

[3] Peter W Shor. “Polynomial-time algorithms for prime factorization and dis- crete logarithms on a quantum computer”. In: SIAM review 41.2 (1999), pp. 303–332.

[4] https://csrc.nist.gov/projects/post-quantum-cryptography/post- quantum-cryptography-standardization.

[5] Lov K Grover. “A fast quantum mechanical algorithm for database search”. In: arXiv preprint quant-ph/9605043 (1996).