To obtain access to full text of journal and articles you must register!
- Article name
- A method for reducing the signature size in randomized algorithms
- Authors
- Moldovyan D. N., , mdn.spectr@mail.ru, St. Petersburg Electrotechnical Univeristy "LETI", St. Petersburg, Russia
Kostina A. A., , anya@hotbox.ru, St. Petersburg Federal Research Center of the RAS (SPC RAS), St. Petersburg, Russia
Morozova E. V., , evmgumrf@mail.ru, Admiral Makarov State University of Maritime and Inland Shipping, St. Petersburg, Russia
- Keywords
- computer security / digital signature / post-quantum cryptography / finite associative algebra / non-commutative algebra / hidden group / hash-function
- Year
- 2023 Issue 1 Pages 29 - 34
- Code EDN
- OMUFLQ
- Code DOI
- 10.52190/2073-2600_2023_1_29
- Abstract
- A method is proposed for reducing the bit length of the signature in randomized digital signature algorithms of two different types, based on the computational difficulty: of the discrete logarithm problem and of solving systems of many quadratic equations with many unknowns. In the considered signature algorithms, the randomizing element of the signature is calculated as a hash function value, therefore, in order to provide L-bit resistance to attacks based on collision search, it is required to use hash functions with 2L-bit values. The proposed method uses two independent hash functions with L-bit values. One of them is used to calculate the first element of the signature, and the second one is used to calculate the value of the hash function h from the signed document. The value of h enters the check equation as a power at one of the factors, which provides an L-bit level of resistance to attacks based on collision search with an L-bit randomizing signature element.
- Text
- BUY for read the full text of article
- Buy
- 500.00 rub
