Author:
Sakalauskas Eligijus,Timofejeva Inga,Kilciauskas Ausrys
Abstract
A new sigma identification protocol (SIP) based on matrix power function (MPF) defined over the modified medial platform semigroup and power near-semiring is proposed. It is proved that MPF SIP is resistant against direct and eavesdropping attacks. Our security proof relies on the assumption that MPF defined in the paper is a candidate for one-way function (OWF). Therefore, the corresponding MPF problem is reckoned to be a difficult one. This conjecture is based on the results demonstrated in our previous studies, where a certain kind of MPF problem was proven to be NP-complete.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference20 articles.
1. Group-Based Cryptography;Myasnikov,2008
2. Non-Commutative Cryptography and Complexity of Group-Theoretic Problems;Myasnikov,2011
3. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
4. Computers and Intractability: A Guide to Theory of NP-Completeness;Garey,1979
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献