格子暗号 (Japanese Wikipedia)

Analysis of information sources in references of the Wikipedia article "格子暗号" in Japanese language version.

refsWebsite

Global rank Japanese rank

9doi.org

2^nd place

6^th place

8iacr.org

5,032^nd place

9,586^th place

2arxiv.org

69^th place

227^th place

2pq-crystals.org

low place

1weizmann.ac.il

4,983^rd place

low place

1acm.org

1,185^th place

2,667^th place

1ibm.com

1,131^st place

838^th place

1web.archive.org

1^st place

1bris.ac.uk

4,848^th place

low place

1nyu.edu

1,174^th place

2,751^st place

1worldcat.org

5^th place

19^th place

acm.org

dl.acm.org

Gentry, Craig (1 January 2009). A Fully Homomorphic Encryption Scheme (Thesis). Stanford, CA, USA: Stanford University.

arxiv.org

Brakerski, Zvika; Langlois, Adeline; Peikert, Chris; Regev, Oded; Stehle, Damien (2013-01-01). “Classical hardness of learning with errors”. Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13. ACM. pp. 575?584. arXiv:1306.0281. doi:10.1145/2488608.2488680. ISBN 9781450320290
Shor, Peter W. (1997-10-01). “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”. SIAM Journal on Computing 26 (5): 1484?1509. arXiv:quant-ph/9508027. doi:10.1137/S0097539795293172. ISSN 0097-5397.

bris.ac.uk

cs.bris.ac.uk

“LASH: A Lattice Based Hash Function”. October 16, 2008時点のオリジナルよりアーカイブ。2008年7月31日閲覧。 (broken)

doi.org

Ajtai, Miklos (1996). “Generating Hard Instances of Lattice Problems”. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. pp. 99?108. doi:10.1145/237814.237838. ISBN 978-0-89791-785-8
Hoffstein, Jeffrey; Pipher, Jill; Silverman, Joseph H. (1998). “NTRU: A ring-based public key cryptosystem”. Algorithmic Number Theory. Lecture Notes in Computer Science. 1423. pp. 267?288. doi:10.1007/bfb0054868. ISBN 978-3-540-64657-0
Regev, Oded (2005-01-01). “On lattices, learning with errors, random linear codes, and cryptography”. Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05. ACM. pp. 84?93. doi:10.1145/1060590.1060603. ISBN 978-1581139600
Peikert, Chris (2009-01-01). “Public-key cryptosystems from the worst-case shortest vector problem”. Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09. ACM. pp. 333?342. doi:10.1145/1536414.1536461. ISBN 9781605585062
Brakerski, Zvika; Langlois, Adeline; Peikert, Chris; Regev, Oded; Stehle, Damien (2013-01-01). “Classical hardness of learning with errors”. Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13. ACM. pp. 575?584. arXiv:1306.0281. doi:10.1145/2488608.2488680. ISBN 9781450320290
Lyubashevsky, Vadim; Peikert, Chris; Regev, Oded (2010-05-30) (英語). On Ideal Lattices and Learning with Errors over Rings. Lecture Notes in Computer Science. 6110. 1?23. doi:10.1007/978-3-642-13190-5_1. ISBN 978-3-642-13189-9
Guneysu, Tim; Lyubashevsky, Vadim; Poppelmann, Thomas (2012). “Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems”. Cryptographic Hardware and Embedded Systems ? CHES 2012. Lecture Notes in Computer Science. 7428. IACR. pp. 530?547. doi:10.1007/978-3-642-33027-8_31. ISBN 978-3-642-33026-1 2017年1月11日閲覧。
Scott Contini, Krystian Matusiewicz, Josef Pieprzyk, Ron Steinfeld, Jian Guo, San Ling and Huaxiong Wang (2008). “Cryptanalysis of LASH”. Fast Software Encryption. Lecture Notes in Computer Science. 5086. pp. 207-223. doi:10.1007/978-3-540-71039-4_13. ISBN 978-3-540-71038-7. https://eprint.iacr.org/2007/430.pdf
Shor, Peter W. (1997-10-01). “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”. SIAM Journal on Computing 26 (5): 1484?1509. arXiv:quant-ph/9508027. doi:10.1137/S0097539795293172. ISSN 0097-5397.

iacr.org

eprint.iacr.org

Peikert, Chris (2014年7月16日). “Lattice Cryptography for the Internet”. IACR. 2017年1月11日閲覧。
Alkim, Erdem; Ducas, Leo; Poppelmann, Thomas; Schwabe, Peter (2015-01-01). Post-quantum key exchange - a new hope. http://eprint.iacr.org/2015/1092.
Bos, Joppe; Costello, Craig; Ducas, Leo; Mironov, Ilya; Naehrig, Michael; Nikolaenko, Valeria; Raghunathan, Ananth; Stebila, Douglas (2016-01-01). Frodo: Take off the ring! Practical, Quantum-Secure Key Exchange from LWE. http://eprint.iacr.org/2016/659.
Scott Contini, Krystian Matusiewicz, Josef Pieprzyk, Ron Steinfeld, Jian Guo, San Ling and Huaxiong Wang (2008). “Cryptanalysis of LASH”. Fast Software Encryption. Lecture Notes in Computer Science. 5086. pp. 207-223. doi:10.1007/978-3-540-71039-4_13. ISBN 978-3-540-71038-7. https://eprint.iacr.org/2007/430.pdf
Brakerski, Zvika; Vaikuntanathan, Vinod (2011). Efficient Fully Homomorphic Encryption from (Standard) LWE. https://eprint.iacr.org/2011/344.
Brakerski, Zvika; Vaikuntanathan, Vinod (2013). Lattice-Based FHE as Secure as PKE. https://eprint.iacr.org/2013/541.
Garg, Sanjam; Gentry, Craig; Halevi, Shai; Raykova, Mariana; Sahai, Amit; Waters, Brent (2013-01-01). Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits. https://eprint.iacr.org/2013/451.

iacr.org

Guneysu, Tim; Lyubashevsky, Vadim; Poppelmann, Thomas (2012). “Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems”. Cryptographic Hardware and Embedded Systems ? CHES 2012. Lecture Notes in Computer Science. 7428. IACR. pp. 530?547. doi:10.1007/978-3-642-33027-8_31. ISBN 978-3-642-33026-1 2017年1月11日閲覧。

ibm.com

“IBMの研究者、NISTの耐量子標準の開発を支援へ | Think Blog Japan”. IBM. 2022年10月24日閲覧。

nyu.edu

cims.nyu.edu

Micciancio, Daniele; Regev, Oded (2008-07-22). Lattice-based cryptography 2017年1月11日閲覧。.

pq-crystals.org

Peter Schwabe. “Kyber”. 2022年10月24日閲覧。
Peter Schwabe. “Dilithium”. 2022年10月24日閲覧。

web.archive.org

“LASH: A Lattice Based Hash Function”. October 16, 2008時点のオリジナルよりアーカイブ。2008年7月31日閲覧。 (broken)

weizmann.ac.il

eccc.weizmann.ac.il

Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence

worldcat.org

search.worldcat.org

Shor, Peter W. (1997-10-01). “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”. SIAM Journal on Computing 26 (5): 1484?1509. arXiv:quant-ph/9508027. doi:10.1137/S0097539795293172. ISSN 0097-5397.