A new hard problem over non-commutative finite groups for cryptographic protocols

Authors:
Dmitriy N. Moldovyan;Nikolay A. Moldovyan
Affiliations:
St. Petersburg Institute for Informatics and Automation, Russian Academy of Sciences, St. Petersburg, Russia;St. Petersburg Institute for Informatics and Automation, Russian Academy of Sciences, St. Petersburg, Russia
Venue:
MMM-ACNS'10 Proceedings of the 5th international conference on Mathematical methods, models and architectures for computer network security
Year:
2010

Citing 4
Cited 0

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
New Public-Key Cryptosystem Using Braid Groups

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of the public-key encryption based on braid groups

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
A practical attack on a braid group based cryptographic protocol

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new computationally difficult problem defined over noncommutative 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.