To obtain access to full text of journal and articles you must register!
- Article name
- General method for constructing cryptoschemes based on difficulty of simultaneous solving factoring and discrete logarithm problems
- 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
Scherbakov V. A., , scerb@math.md, Institute of Mathematics and Computer Science, Academy of Sciences of Moldova (IMIASM, Kishinev), Kishinev, Moldova
- Keywords
- cryptosystem / cryptographic protocol / digital signature / public encryption / auntification protocol / factorization problem / discrete logarithm problem / integrated security parameter
- Year
- 2014 Issue 2 Pages 3 - 11
- Code EDN
- Code DOI
- Abstract
- There is considered a general method for designing cryptoschemes of different types security of which is based on difficulty of simultaneous solving the factoring and the discrete logarithm problems. There are proposed new digital signature (usual, blind, collective) protocols, public key encryption algorithms, public key distribution scheme. Using of the proposed method provides reducing the signature size and increasing the rate of the cryptoschemes based on the mentioned two problems.
- Text
- To obtain access to full text of journal and articles you must register!
- Buy
