-
Tytuł:
-
A New Hard Problem over Non-commutative Finite Groups for Cryptographic Protocols.
-
Autorzy:
-
Moldovyan, Dmitriy N.
Moldovyan, Nikolay A.
-
Źródło:
-
Computer Network Security (9783642147050); 2010, p183-194, 12p
-
A new computationally difficult problem defined over non-commutative finite groups is proposed as cryptographic primitive. The problem is used to construct public key agreement protocol and algorithms for public and commutative encryption. Finite non-commutative groups of the four-dimension vectors over the ground field are constructed and investigated as primitives for implementing the protocols and algorithms based on the proposed difficult problem. [ABSTRACT FROM AUTHOR]
Copyright of Computer Network Security (9783642147050) is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)