СЛОЖНОСТЬ ВЫЧИСЛЕНИЯ КОРНЕЙ В КОНЕЧНЫХ ГРУППАХ ИЗВЕСТНОГО ПОРЯДКА КАК КРИПТОГРАФИЧЕСКИЙ ПРИМИТИВ
In this paper there is shown that in special cases acyclic finite groups big simple power root finding problem is computational hard. Digital Signature algorithm could be based on this problem. Proposed cases of use of this groups and developed Digital Signature algorithm.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Moscow Engineering Physics Institute
2009-06-01
|
| Series: | Bezopasnostʹ Informacionnyh Tehnologij |
| Online Access: | https://bit.mephi.ru/index.php/bit/article/view/876 |