We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
On semigroups of multivariate transformations constructed in terms of time dependent linguistic graphs and solutions of Post Quantum Multivariate Cryptography.
International Association for Cryptologic Research (IACR)
Abstract
Time dependent linguistic graphs over abelian group H are introduced. In the case H=Kβ such bipartite graph with point set P=Hn can be used for generation of Eulerian transformation of (Kβ)n, i.e. the endomorphism of K[x1β,x2β,β¦,xnβ] sending each variable to a monomial term. Subsemigroups of such endomorphisms together with their special homomorphic images are used as platforms of cryptographic protocols of noncommutative cryptography.
The security of these protocol is evaluated via complexity of hard problem of decomposition of Eulerian transformation into the product of known generators of the semigroup. Nowadays the problem is intractable one in the Postquantum setting.
The symbiotic combination of such protocols with special graph based stream ciphers working with plaintext space of kind Km where m=nt for arbitrarily chosen parameter t is proposed.
This way we obtained a cryptosystem with encryption/decryption procedure of complexity O(m1+2/t)
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.