Key Agreement Protocol (KAP) using conjugacy and discrete logarithm problems in group representation level

zbMATH Open1119.68077MaRDI QIDQ3594286FDOQ3594286

Authors: Eligijus Sakalauskas, Povilas Tvarijonas, Andrius Raulynaitis 

Publication date: 7 August 2007

Recommendations

• Non-Abelian key agreement protocols
• scientific article; zbMATH DE number 6533407
• scientific article; zbMATH DE number 2086696
• scientific article; zbMATH DE number 2080992
• A new key exchange protocol based on the decomposition problem

zbMATH Keywords

discrete logarithm problemgroup representationkey agreement protocolconjugator search problem

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (11)

• Enhanced matrix power function for cryptographic primitive construction
• Improved asymmetric cipher based on matrix power function with provable security
• On Eulerian semigroups of multivariate transformations and their cryptographic applications
• Non-associative public-key cryptography
• A novel version of the hidden logarithm problem for post-quantum signature algorithms
• On new protocols of Noncommutative Cryptography in terms of homomorphism of stable multivariate transformation groups
• Non-commutative finite associative algebras of 2-dimensional vectors
• An analysis of some key distribution public systems based on non-abelian groups
• Authenticated commutator key agreement protocol
• Undeniable signature scheme based over group ring
• On the security of DLCSP over \(\mathrm{GL}_n (\mathbb{F}_q [S_r])\)

This page was built for publication: Key Agreement Protocol (KAP) using conjugacy and discrete logarithm problems in group representation level

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3594286)