최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기한국전자통신학회 논문지 = The Journal of the Korea Institute of Electronic Communication Sciences, v.16 no.4, 2021년, pp.683 - 688
Digital signature algorithms such as RSA and ECDSA are threatened by the development of quantum computer technology, which is attracting attention as a future technology. Alternatively, various post-quantum algorithms such as grid-based, multivariate-based, code-based, and hash-based are being studi...
R. L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Communications of the ACM, vol. 21, no. 2, Feb. 1978, pp. 120-126.
D. Johnson, A. Menezes, and S. Vanstone, "The Elliptic Curve Digital Signature Algorithm (ECDSA)," Int. J. of Information Security, vol. 1, no. 1, Aug 2001, pp. 36-63.
P. W. Shor, "Algorithms for quantum computation: discrete logarithms and factoring," In Proc. 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA, 1994, pp. 124-134.
J. Hoffstein, N. Howgrave-Graham, J. Pipher, J. H. Silverman, and W. Whyte, "NTRUSign: Digital signatures using the NTRU lattice," Lecture Notes in Computer Science, vol. 2612, 2003, pp. 122-140.
J. Porras, J. Baena, and J. Ding, "ZHFE, A New Multivariate Public Key Encryption Scheme," Lecture Notes in Computer Science, vol. 8772, 2014, pp. 229-245.
R. J. McEliece, "A Public-Key Cryptosystem Based On Algebraic Coding Theory," The Deep Space Network Progress Report, vol. 42, no. 44, 1978, pp. 114-116.
L. K. Grover, "A fast quantum mechanical algorithm for database search," In Proc. the Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA, July 1996, pp. 212-219.
L. Lamport, "Constructing Digital Signatures from a One Way Function," Technical Report SRI-CSL-98, Oct. 1979.
R. C. Merkle, "A Certified Digital Signature," Lecture Notes in Computer Science, vol. 435, 1990, pp. 218-238.
A. Hulsing, "W-OTS+ - Shorter signatures for hash-based signature schemes," Lecture Notes in Computer Science, vol. 7918, 2013, pp. 173-188.
L. Reyzin and N. Reyzin, "Better than BiBa: Short one-time signatures with fast signing and verifying," Lecture Notes in Computer Science, vol. 2384, 2002, pp. 144-153.
J. Lee, S. Kim, Y. Cho, Y. Chung, and Y. Park, "HORSIC: An efficient one-time signature scheme for wireless sensor networks," Information Processing Letters, vol. 112, no. 20, 2012, pp. 783-787.
J. Buchmann, E. Dahmen, and A. Hulsing, "XMSS - A practical forward secure signature scheme based on minimal security assumptions," Lecture Notes in Computer Science, vol. 7071, 2011, pp. 117-129.
D. J. Bernstein, D. Hopwood, A. Hulsing, T. Lange, R. Niederhagen, L. Papachristodoulou, M. Schneider, P. Schwabe, and Z. Wilcox-O'hearn, "SPHINCS: Practical stateless hash-based signatures," Lecture Notes in Computer Science, vol. 9056, 2015, pp. 368-397.
J. P. Aumasson and G. Endignoux, "Improving stateless hash-based signatures," Lecture Notes in Computer Science, vol. 10808, 2018, pp. 219-242.
A. Chailloux, M. Naya-Plasencia, and A. Schrottenloher, "An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography," Lecture Notes in Computer Science, vol. 10625, 2017, pp. 211-240.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
Free Access. 출판사/학술단체 등이 허락한 무료 공개 사이트를 통해 자유로운 이용이 가능한 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.