To obtain access to full text of journal and articles you must register!
- Article name
- Signature algorithm with a hidden group, based on computational complexity of two independent problems
- Authors
- Moldovyan A. A., , maa1305@yandex.ru, St. Petersburg Electrotechnical Univeristy "LETI", St.-Petersburg, Russia
Moldovyan N. A., , nmold@mail.ru, St. Petersburg Federal Research Center of the RAS (SPC RAS), St. Petersburg, Russia
Levina A. B., , alla_levina@mail.ru, St. Petersburg Electrotechnical Univeristy "LETI", St. Petersburg, Russia
- Keywords
- information security / post-quantum cryptography / digital signature / finite associative algebra / non-commutative algebra / cyclic group / two-dimensional cyclicity
- Year
- 2022 Issue 4 Pages 27 - 31
- Code EDN
- JYLMGW
- Code DOI
- 10.52190/2073-2600_2022_4_27
- Abstract
- The issue of increasing the security level of algebraic digital signature algorithms with a hidden group is considered. The applied method is connected with the design due to which breaking the signature algorithm requires the simultaneous solving two independent computationally difficult problems. The latter are finding the discrete logarithm and solving a system of many quadratic equations with many unknowns. An algorithm implemented within the framework of this approach is described.
- Text
- BUY for read the full text of article
- Buy
- 500.00 rub
