To obtain access to full text of journal and articles you must register!
- Article name
- A method for specifying complete randomization of a signature and an algebraic algorithm based on it
- Authors
- Kurysheva A. A., , kurysheva.al@yandex.ru, St. Petersburg Federal Research Centerof of the RAS (SPC RAS), St. Petersburg, Russia
- Keywords
- finite non-commutative algebra / associative algebra / computationally difficult problem / hidden commutative group / digital signature / post-quantum cryptography
- Year
- 2024 Issue 1 Pages 38 - 46
- Code EDN
- RPLELR
- Code DOI
- 10.52190/2073-2600_2024_1_38
- Abstract
- To eliminate the limitations of signature randomization in known algebraic algorithms with a hidden group, the security of which is based on the computational complexity of solving large systems of power equations, a method for ensuring complete randomization is proposed. Based on the method, a new algorithm of the specified type has been developed, using a four-dimensional finite non-commutative associative algebra as an algebraic support. Estimates of the algorithm's security to direct attacks and to attacks based on known signatures are obtained, which confirm the effectiveness of the proposed signature randomization method. The developed algorithm is of interest as a potential practical post-quantum digital signature scheme, due to the relatively small size of the public and private keys and signature.
- Text
- BUY for read the full text of article
- Buy
- 500.00 rub
