To obtain access to full text of journal and articles you must register!
- Article name
- Fast method for commutative encryption
- Authors
- Moldovyan A. A., , nmold@mail.ru, St. Petersburg Institute for Informatics and Automation of Russian Academy of Sciences, St.-Petersburg, Russia
Goryachev A. A., , mdn.spectr@mail.ru, St. Petersburg Institute for Informatics and Automation of the RAS, St.-Petersburg, Russia
Latyshev D. M., , ldm@cobra.ru, St. Petersburg Institute for Informatics and Automation of the RAS, St.-Petersburg, Russia
- Keywords
- information protection / cryptography / encryption / commutative encryption / local keys / single-use keys / finite groups / non-commutative groups / computationally difficult problem
- Year
- 2017 Issue 1 Pages 3 - 11
- Code EDN
- Code DOI
- Abstract
- Commutative encryption algorithms used in a number of cryptographic protocols are based on computational difficulty of discrete logarithm and require performing the exponentiation operations modulo a large prime. This restricts significantly performance of such ciphers. Present paper proposes a fast method for commutative encryption, which is based on a novel computationally difficult problem and on applying the single-use keys. The used computational problem is formulated in finite non-commutative group and consists in representing some group element in the form of production of three other elements two of which are contained in two given commutative subgroups and the third one is fixed. There are discussed methods for constructing non-commutative finite groups of vectors.
- Text
- To obtain access to full text of journal and articles you must register!
- Buy
