Cryptology ePrint Archive: Report 2019/303

Analysis of TPL Signature Scheme

Terry Shue Chien Lau and Chik How Tan and Theo Fanuela Prabowo

Abstract: Tan et al. proposed a rank metric code-based signature (TPL) in the 2018 International Symposium on Information Theory and Its Application [3]. Their proposal has compact key size ($8.29$KB, $1.97$KB and $2.90$KB for public key, private key and signature respectively) compared to other code-based signature submitted to the NIST call for Post-Quantum Cryptography Standardization at $128$-bit post-quantum security level. This short paper aims to discuss the practical security of the TPL signature. In particular, we describes how to recover the private key in TPL with practical simulations. Our experimental results show that we are able to recover the private key of TPL in less than $23$ milliseconds for all the proposed schemes at $82$-bit, $98$-bit and $129$-bit post-quantum security level.

Category / Keywords: public-key cryptography / Post-quantum Signatures, Cryptanalysis, Key Recovery Attack, Public-key Encryption

Date: received 18 Mar 2019, last revised 18 Mar 2019

Contact author: tsltlsc at nus edu sg

Available format(s): PDF | BibTeX Citation

Version: 20190320:103056 (All versions of this report)

Short URL: ia.cr/2019/303


[ Cryptology ePrint archive ]