2021年
Ramanujan Graphs for Post-Quantum Cryptography
International Symposium on Mathematics, Quantum Theory, and Cryptography
- ,
- ,
- 開始ページ
- 231
- 終了ページ
- 250
- 記述言語
- 掲載種別
- 論文集(書籍)内論文
- DOI
- 10.1007/978-981-15-5191-8_17
- 出版者・発行元
- Springer Singapore
<title>Abstract</title>
We introduce a cryptographic hash function based on expander graphs, suggested by Charles et al. ’09, as one prominent candidate in post-quantum cryptography. We propose a generalized version of explicit constructions of Ramanujan graphs, which are seen as an optimal structure of expander graphs in a spectral sense, from the previous works of Lubotzky, Phillips, Sarnak ’88 and Chiu ’92. We also describe the relationship between the security of Cayley hash functions and word problems for group theory. We also give a brief comparison of LPS-type graphs and Pizer’s graphs to draw attention to the underlying hard problems in cryptography.
We introduce a cryptographic hash function based on expander graphs, suggested by Charles et al. ’09, as one prominent candidate in post-quantum cryptography. We propose a generalized version of explicit constructions of Ramanujan graphs, which are seen as an optimal structure of expander graphs in a spectral sense, from the previous works of Lubotzky, Phillips, Sarnak ’88 and Chiu ’92. We also describe the relationship between the security of Cayley hash functions and word problems for group theory. We also give a brief comparison of LPS-type graphs and Pizer’s graphs to draw attention to the underlying hard problems in cryptography.
- リンク情報
- ID情報
-
- DOI : 10.1007/978-981-15-5191-8_17
- ISSN : 2198-350X
- eISSN : 2198-3518