To obtain access to full text of journal and articles you must register!
- Article name
- Collective 240-bit digital signature protocol over non-cyclic finite group
- Authors
- Moldovyan N. A., , nmold@mail.ru, St. Petersburg Federal Research Center of the RAS (SPC RAS), St. Petersburg, Russia
Berezin A. N., , a.n.berezin.ru@gmail.com, St.-Petersburg State Electrotechnical University"LETI", St.-Petersburg, Russia
Latyshev D. M., , dmitriy.0987@gmail.com, St.-Petersburg Institute for Informatics and Automation of Russian Academy of Sciences, St.-Petersburg, Russia
- Keywords
- cryptographic protocol / digital signature / collective signature / factoring problem / discrete logarithm problem / public key
- Year
- 2013 Issue 3 Pages 81 - 85
- Code EDN
- Code DOI
- Abstract
- For the first time it is considered design of the collective signature protocol based on difficulty of finding discrete logarithm modulo a composite number that represent the product of two strong primes their size ratio 2:1. This provides increasing security of the protocol in line with reducing probability to break the protocol with a breakthrough algorithm for solving computational difficult problems of factoring and discrete logarithm. Peculiarity of the protocol is using the non-cyclic finite group. For the case of the 80-bit security, the collective signature length is 240 bits independently of the number of signers.
- Text
- To obtain access to full text of journal and articles you must register!
- Buy
