Abstract
References
- [1] Diffie, W., Hellman, M., New Directions in Cryptography, IEEE Transactions on Information Theory, vol. 22 (6), 1976, pp. 644--654.
- [2] Shor, P.W., Algorithms for Quantum Computation: Discrete Logarithms and Factoring, In Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE, 1994, pp. 124--134.
- [3] De Wolf, R., Quantum Computing: Lecture Notes, arXiv preprint arXiv:1907.09415, 2019, pp. 1--11.
- [4] NIST Post-Quantum Cryptography Standardization Project, https://csrc.nist.gov/projects/post-quantumcryptography (Erişim Tarihi: 21.10.2019)
- [5] Bernstein, D. J., Buchmann, J., Dahmen, E., Post-Quantum Cryptography, 1st ed., Springer, 2008, pp. 1--13.
- [6] Saarinen, M.J.O., Hila5, Technical Report, National Institute of Standards and Technology (NIST), 2017.
- [7] Gao, X., Comparison Analysis of Ding's RLWE-Based Key Exchange Protocol and NewHope Variants, Advances in Mathematics of Communications, vol. 13 (2), 2019, pp. 221--233.
- [8] Alperin-Sheriff, J., Suggested Avenues for Lattice-Based Research, In Lattice Crypto and Algorithms, University Residential Center, Italy, 2018.
- [9] Akleylek, S., Seyhan, K., Kafes-Tabanlı Anahtar Değişim/Paketleme Protokollerinde Kullanılan Uzlaşma Yöntemleri, The 4th International Conference on Computer Science and Engineering (UBMK’19), IEEE, 2019, pp. 91--96.
- [10] Ding, J., Takagi, T., Gao, X., Wang, Y., Ding Key Exchange, Technical Report, National Institute of Standards and Technology (NIST), 2017.
- [11] Peikert, C., Lattice Cryptography for the Internet, Post-Quantum Cryptography, Springer, LNCS, vol. 8772, 2014, pp. 197-- 219.
- [12] Hamburg, M., Module-LWE Key Exchange and Encryption: The Three Bears, Technical Report, National Institute of Standards and Technology (NIST), 2017.
- [13] Jing, Z., Gu, C., Yu, Z., Shi, P., Gao, C., Cryptanalysis of Lattice-based Key Exchange on Small Integer Solution Problem and its Improvement, Cluster Computing, vol. 22 (1), 2019, pp. 1717--1727.
- [14] Lyubashevsky, V., Peikert, C., Regev, O., On Ideal Lattices and Learning with Errors Over Rings, Advances in Cryptology – EUROCRYPT 2010, LNCS, vol. 6110, 2010, pp. 1--23.
- [15] Langlois, A., Stehle, D., Worst-case to average-case reductions for module lattices, Designs, Codes and Cryptography, vol. 75 (3), 2015, pp. 565--599.
- [16] Albrecht, M. R., et al., Estimate All the {LWE, NTRU} Schemes!, Security and Cryptography for Networks, SCN 2018, LNCS, vol. 11035, 2018, pp. 351--367.
Kafes-Tabanlı Anahtar Değişim/Paketleme Protokollerinde Kullanılan Uzlaşma Yöntemlerine Ait Bileşenlerin Analizi
Abstract
Kafes-tabanlı
Diffie-Hellman benzeri anahtar değişim/paketleme protokollerinde kullanılan zor
problemlerin yapısı gereği ortak paylaşılan anahtarın elde edilmesinde ara
işlem adımlarına ihtiyaç duyulur. Uzlaşma yapıları olarak isimlendirilen bu
adımların farklılaşması ile kuantum sonrası kriptografi için alternatif
sistemler önerilebilecektir. Bu çalışmada,
RLWE problemi tabanlı Ding17, Peikert14, Saarinen17 ile MLWE problemi
tabanlı Hamburg17 ve Bi-GISIS problemi tabanlı Jing18 anahtar değişim/paketleme
protokolleri içerdikleri problemlere, kullanılan cebirsel yapılara ve
protokollerin işleyiş aşamalarına göre farklılaşan uzlaşma yöntemleri açısından
karşılaştırılmıştır. Yapılan bu karşılaştırma sonucu yuvarlama işlemi ve ek
bilgi hesabı içeren ve içermeyen, farklı parçalanışlarına sahip bir veya daha fazla
uzlaşma fonksiyonu kullanan protokollerin içermesi gereken işleyiş adımları
tespit edilmiştir. Elde edilen bilgiler ile yeni bir yaklaşımın içerebileceği
temel yapı açıklanarak açık problemlere çözüm önerisi sunabilen gelecek çalışmalara
yer verilmiştir.
References
- [1] Diffie, W., Hellman, M., New Directions in Cryptography, IEEE Transactions on Information Theory, vol. 22 (6), 1976, pp. 644--654.
- [2] Shor, P.W., Algorithms for Quantum Computation: Discrete Logarithms and Factoring, In Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE, 1994, pp. 124--134.
- [3] De Wolf, R., Quantum Computing: Lecture Notes, arXiv preprint arXiv:1907.09415, 2019, pp. 1--11.
- [4] NIST Post-Quantum Cryptography Standardization Project, https://csrc.nist.gov/projects/post-quantumcryptography (Erişim Tarihi: 21.10.2019)
- [5] Bernstein, D. J., Buchmann, J., Dahmen, E., Post-Quantum Cryptography, 1st ed., Springer, 2008, pp. 1--13.
- [6] Saarinen, M.J.O., Hila5, Technical Report, National Institute of Standards and Technology (NIST), 2017.
- [7] Gao, X., Comparison Analysis of Ding's RLWE-Based Key Exchange Protocol and NewHope Variants, Advances in Mathematics of Communications, vol. 13 (2), 2019, pp. 221--233.
- [8] Alperin-Sheriff, J., Suggested Avenues for Lattice-Based Research, In Lattice Crypto and Algorithms, University Residential Center, Italy, 2018.
- [9] Akleylek, S., Seyhan, K., Kafes-Tabanlı Anahtar Değişim/Paketleme Protokollerinde Kullanılan Uzlaşma Yöntemleri, The 4th International Conference on Computer Science and Engineering (UBMK’19), IEEE, 2019, pp. 91--96.
- [10] Ding, J., Takagi, T., Gao, X., Wang, Y., Ding Key Exchange, Technical Report, National Institute of Standards and Technology (NIST), 2017.
- [11] Peikert, C., Lattice Cryptography for the Internet, Post-Quantum Cryptography, Springer, LNCS, vol. 8772, 2014, pp. 197-- 219.
- [12] Hamburg, M., Module-LWE Key Exchange and Encryption: The Three Bears, Technical Report, National Institute of Standards and Technology (NIST), 2017.
- [13] Jing, Z., Gu, C., Yu, Z., Shi, P., Gao, C., Cryptanalysis of Lattice-based Key Exchange on Small Integer Solution Problem and its Improvement, Cluster Computing, vol. 22 (1), 2019, pp. 1717--1727.
- [14] Lyubashevsky, V., Peikert, C., Regev, O., On Ideal Lattices and Learning with Errors Over Rings, Advances in Cryptology – EUROCRYPT 2010, LNCS, vol. 6110, 2010, pp. 1--23.
- [15] Langlois, A., Stehle, D., Worst-case to average-case reductions for module lattices, Designs, Codes and Cryptography, vol. 75 (3), 2015, pp. 565--599.
- [16] Albrecht, M. R., et al., Estimate All the {LWE, NTRU} Schemes!, Security and Cryptography for Networks, SCN 2018, LNCS, vol. 11035, 2018, pp. 351--367.
Details
| Primary Language | Turkish |
|---|---|
| Journal Section | Makaleler(Araştırma) |
| Authors | |
| Publication Date | April 13, 2020 |
| Published in Issue | Year 2020 Volume: 13 Issue: 1 |
Cite
Article Acceptance
Use user registration/login to upload articles online.
The acceptance process of the articles sent to the journal consists of the following stages:
1. Each submitted article is sent to at least two referees at the first stage.
2. Referee appointments are made by the journal editors. There are approximately 200 referees in the referee pool of the journal and these referees are classified according to their areas of interest. Each referee is sent an article on the subject he is interested in. The selection of the arbitrator is done in a way that does not cause any conflict of interest.
3. In the articles sent to the referees, the names of the authors are closed.
4. Referees are explained how to evaluate an article and are asked to fill in the evaluation form shown below.
5. The articles in which two referees give positive opinion are subjected to similarity review by the editors. The similarity in the articles is expected to be less than 25%.
6. A paper that has passed all stages is reviewed by the editor in terms of language and presentation, and necessary corrections and improvements are made. If necessary, the authors are notified of the situation.
.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.