Author:
Ustimenko Vasyl, ,Klisowski Michał,
Abstract
Noncommutative cryptography is based on applications of algebraic structures like noncommutative groups, semigroups, and noncommutative rings. Its intersection with Multivariate cryptography contains studies of cryptographic applications of subsemigroups and subgroups of affine Cremona semigroups defined over finite commutative rings. Efficiently computed homomorphisms between stable subsemigroups of affine Cremona semigroups can be used in tame homomorphisms protocols schemes and their inverse versions. The implementation scheme with the sequence of subgroups of affine Cremona group that defines the projective limit was already suggested. We present the implementation of another scheme that uses two projective limits which define two different infinite groups and the homomorphism between them. The security of the corresponding algorithm is based on complexity of the decomposition problem for an element of affine Cremona semigroup into a product of given generators. These algorithms may be used in postquantum technologies.
Publisher
Luhansk Taras Shevchenko National University
Subject
Discrete Mathematics and Combinatorics,Algebra and Number Theory
Reference37 articles.
1. [1]M. Anshel, M. Anshel, and D. Goldfeld. An algebraic method for public-keycryptography. Math. Res. Lett., 6:287-291, 1999.
2. [2]S. Blackburn and S. Galbraith. Cryptanalysis of two cryptosystems based on groupactions. In K. Lam, C. Xing, and E. Okamoto, editors, Advances in Cryptologyś ASIACRYPT '99, Lecture Notes in Computer Science, pages 52-61. Springer,1999.
3. [3] Z. Cao. New Directions of Modern Cryptography. CRC Press, 2012.
4. [4]J. Ding, J. E. Gower, and D. S. Schmidt. Multivariate Public Key Cryptosystems. Advances in Information Security. Springer, 2006.
5. [5]B. Fine, M. Habeeb, D. Kahrobaei, and G. Rosenberger. Aspects of nonabelian group based cryptography: A survey and open problems. arXiv:1103.4093 [cs.CR], 2011. http://arxiv.org/.