[1] Shannon, C.E. Communication Theory of Secrecy Systems. Bell Syst. Tech. J., 1949, 28, pp. 656–715.
[2] NIST, Announcing the ADVANCED ENCRYPTION STANDARD (AES), Federal Information Processing Standards Publication 197, November, 26, 2001.
[3] Diffie, W.; Hellman, M. New directions in cryptography. IEEE Trans. Inf. Theory, 1976, 22, pp. 644–654.
[4] Rivest, R.L.; Shamir, A.; Adleman, L. A method for obtaining digital signa- tures and public-key cryptosystems, Commun. ACM, 1978, 21, pp. 120–126.
[5] Merkle, R.C. Secure communication over an insecure channel, Common. ACM, 1978, 21, pp. 294–299.
[6] Pollard, J. Monte Carlo Methods for Index Computation (modp). Math. Com- put.,1978, 32, pp. 918–924.
[7] Pohlig, S.; Hellman, M. An improved algorithm for computing logarithms over GF (p) and its cryptographic significance (Corresp.). IEEE Trans. Inf. Theory, 1978, 24, pp. 106–110. DOI:10.1109/TIT.1978.1055817.
[8] Adrian, D.; Bhargavan, K.; Durumeric, Z.; Gaudry, P.; Green, M.; Halder- man, J.A.; Heninger, N.; Springall, D.; Thom´e, E.; Valenta, L.; et al. Imper- fect Forward Secrecy: How Diffie-Hellman Fails in Practice. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, 12–16 October 2015; pp. 5–17.
[9] NIST, Recommendation for Key Management: Part 1 - General. May, 2020. https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST. SP.800-57pt1r5.pdf (accessed on 12 August 2021).
[10] 情報処理推進機構; 情報通信研究機構, TLS 暗号設定ガイドライン, July, 2020, https://www.ipa.go.jp/security/ipg/documents/ipa-cryptrec-gl- 3001-3.0.1.pdf. (Acceced on 4 August 2021)
[11] Shor, P.W. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput. 1997, 26, pp. 1484– 1509.
[12] Dridi, R.; Alghassi, H. Prime Factorization Using Quantum Annealing and Computational Algebraic Geometry, 2016, https://arxiv.org/abs/1604. 057962v2.
[13] Martin-L´opez, E.; Laing, A.; Lawson, T.; Alvarez, R.; Zhou, X.-Q.; O ’Brien, J.L. Experimental Realization of Shor ’s Quantum Factoring Algorithm Using Qubit Recycling, Nature Photonics, volume 6, number 11, 2012, pp. 773–776.
[14] Ajtai, M.; Dwork, C. A public-key cryptosystem with worst-case/average- case equivalence. In Proceedings of the 50th ACM Symposium on Theory of Computing, El Paso, TX, USA, 4–6 May 1997; pp. 284–293.
[15] Matsumoto, T.; Imai, H. Public Quadratic Polynomial-Tuples for Effi- cient Signature-Verification and Message-Encryption. Proceedings of EURO- CRYPT, LNCS 330, Springer-Verlag, 1988, pp.419–453.
[16] McEliece, R.J. A Public-Key Cryptosystem based on Algebraic Coding The- ory. Jet Propulsion Laboratory DSN Progress Report, 42-44, 1978, pp.114– 116.
[17] Gentry, C. Fully homomorphic encryption using ideal lattices. In Proceedings of the 41st ACM Symposium on Theory of Computing (STOC), Bethesda, MD, USA, 31 May - 2 June 2009, Volume 9, pp. 169–178.
[18] Regev, O. On lattices, learning with errors, random linear codes, and cryp- tography. Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 84-93.
[19] Peikert, C. Public-key cryptosystems from the worst-case shortest vector prob- lems: extended abstract. In Proc. 41st ACM Symp. on Theory of Computing- STOC 2009, ACM, 2009, pp. 333–342.
[20] Ajtai, M. The shortest vector problem in L2 is NP-hard for randomized re- ductions. Proceedings of the thirtieth annual ACM symposium on Theory of computing. Dallas, Texas, United States: ACM, 1998, pp. 10–19.
[21] Regev, O. On lattices, learning with errors, random linear codes, and cryp- tography. J. ACM, 2009, 56, pp. 1–40.
[22] Peikert, C.; Vaikuntanathan V.; Waters, B. A Framework for Efficient and Composable Oblivious Transfer. Proceedings of CRYPTO, LNCS 5157, Springer-Verlag, 2008, pp. 554–571.
[23] Lyubashevsky, V.; Peikert, C.; Regev, O. On Ideal Lattices and Learning with Errors over Rings. In Advances in Cryptology-EUROCRYPT 2010, Springer LNCS 6110, 2010, pp. 1–23.
[24] Brakerski, Z.; Gentry, C.; Vaikuntanathan, V. (Leveled) fully homomorphic encryption without bootstrapping. In Shafi Goldwasser, editor, ITCS 2012, ACM, January, 2012, pp. 309–325.
[25] Alkim, E.; Ducas, L.; Poppelmann, T.; Schwabe, P. Post-quantum key exchange—A new hope. In Proceedings of the 25th USENIX Security Sym- posium (USENIX Security 16), Austin, TX, USA, 10–12 August, 2016, pp. 327–343.
[26] Bos, J.; Ducas, L.; Kiltz, E.; Lepoint, T.; Lyubashevsky, V.; Schanck, J.M.; Schwabe, P.; Seiler, G.; Stehle, D. CRYSTALS—Kyber: A CCA-Secure module-lattice-based KEM. In Proceedings of the 2018 IEEE European Sym- posium on Security and Privacy (EuroS and P), London, UK, 24–26 April, 2018, pp. 353–367.
[27] Post-Quantum Cryptography Competition Round 2 Submissions. Available online: https://csrc.nist.gov/projects/post-quantum-cryptography/ round-2-submissions (accessed on 13 August 2021).
[28] PQC Standardization Process: Third Round Candidate Announce- ment. Available online: https://csrc.nist.gov/News/2020/ pqc-third-round-candidate-announcement (accessed on 13 August 2021).
[29] Hoffstein, J.; Pipher, J.; Silverman, J.H. NTRU: A Ring-Based Public Key Cryptosystem. Proceedings of Algorithmic Number Theory (ANTS), LNCS 1423, Springer-Verlag, 1998, pp.267–288.
[30] Hu¨lsing, A.; Rijneveld, J.; Schanck, J.; Schwabe, P. High-Speed Key Encap- sulation from NTRU, Proceedings of Cryptographic Hardware and Embedded Systems (CHES) 2017, Lecture Notes in Computer Science, 10529, Springer- Verlag, 2017, pp. 232–252.
[31] Micciancio, D.; Regev. O, Worst-case to Average-case Reductions based on Gaussian Measures. Journal of Computing, 37(1), 2007, pp.267–302.
[32] Laine, K.; Lauter,K. Key Recovery for LWE in Polynomial Time. IACR Cryp- tology ePrint Archive, no.176, 2015.
[33] Aono, Y.; Boyen, X.; Phong, L.T.; Wang, L. Key-Private Proxy Re- Encryption under LWE. Proceedings of INDOCRYPT, LNCS 8520, Springer- Verlag, 2013, pp.1–18.
[34] Albrecht, M.R.; Cid, C.; Faug`ere, J.C.; Fitzpatrick, R.; Perret, L. Algebraic Algorithms for LWE Problems. IACR Cryptology ePrint Archive, no.1018, 2014.
[35] Micciancio, D. The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, FOCS ’98, IEEE Computer Society, 1998, pp. 92–98.
[36] Coppersmith, D.; Shamir, A. Lattice Attacks on NTRU. In Advances in Cryptology—EUROCRYPT ’97; Lecture Notes in Computer Science; Fumy, W., Ed.; Springer: Berlin, Germany; 1997, Volume 1233.
[37] Accardi, L.; Iriyama, S.; Regoli, M.; Ohya, M. Strongly Asymmetric Public Key Agreement Algorithms. ; Technical Report ISEC2011-20; IEICE: Tokyo, Japan, 2011; pp. 111–114.
[38] Accardi, L.; Regoli, M. On a class of strongly asymmetric PKA algorithms. J. Math. Crypt, 2015
[39] Accardi, L.; Iriyana, S.; Jimbo, K.; Regoli, M. A New Class of Strongly Asymmetric PKA Algorithms: SAA-5, Cryptography, 2019, 3(1), 9.
[40] Jimbo, K.; Iriyana, S.; Regoli, M. Implementation of a New Strongly- Asymmetric Algorithm and Its Optimization, Cryptography, 2020, 4(3), 21.
[41] Iriyana, S.; Jimbo, K.; Regoli, M. New Subclass Framework and Concrete Examples of Strongly Asymmetric Public Key Agreement, Appl. Sci. 2021, 11(12), 5540.
[42] Buchberger, B. Theoretical Basis for the Reduction of Polynomials to Canon- ical Forms. ACM SIGSAM Bulletin. ACM. 10 (3), August, 1976, pp. 19–29. DOI:10.1145/1088216.1088219.
[43] Ottaviani, V.; Zanoni, A.; Regoli, M. Conjugation as public key agreement protocol in mobile cryptography. In Proceedings of the 2010 International Conference on Security and Cryptography (SECRYPT), Athens, Greece, 26– 28 July 2010; pp. 1–6.
[44] Jimbo, K.; Iriyama, S.; Regoli, M. Project Name: Implementation of a New Strongly Asymmetric Algorithms and Its Optimization. GitHub Repository. 2020. Available online: https://github.com/jimbobmij/project_KSM (ac- cessed on 29 July 2020)
[45] ElGamal, T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory, 1985, 31, pp. 469–472.
[46] Koblitz, N. Elliptic curve cryptosystems. Math. Comput., 1987, 48, pp. 203– 209.
[47] Großsch¨adl, J.; Kizhvatov, I. Performance and security aspects of client-side SSL/TLS processing on mobile devices. In Proceedings of the International Conference on Cryptology and Network Security, Kuala Lumpur, Malaysia, 12–14 December 2010, Springer: Berlin/Heidelberg, Germany, 2010, pp. 44– 61.
[48] Okeyinka, A.E. Computational speeds analysis of RSA and ElGamal algo- rithms on text data. In Proceedings of the World Congress on Engineering and Computer Science, San Francisco, CA, USA, 21–23 October 2015, Volume 1.
[49] Lamport, L. Constructing Digital Signatures from a One-Way Function. Tech- nical Report CSL-98, SRI International: Menlo Park, CA, USA, 1979, Volume 238.
[50] Merkle, R.C. A Certified Digital Signature, Conference on the Theory and Application of Cryptology. Springer: New York, NY, USA, 1989.
[51] Cooper, D.; Santesson, S.; Farrell, S.; Boeyen, S.; Housley, R.; Polk, W. Internet X. 509 Public Key Infrastructure Certificate and Certificate Re- vocation List (CRL) Profile, RFC 5280, 2008, pp. 1–151. Available online: https://datatracker.ietf.org/doc/html/rfc5280 (accessed on 14 June 2021).