To obtain access to full text of journal and articles you must register!
- Article name
- Protocol for secure encryption with using small-size key based on difficulty of simultaneous solving factorization and discrete logarithm problems
- Authors
- Berezin A. N., , a.n.berezin.ru@gmail.com, St.-Petersburg State Electrotechnical University"LETI", St.-Petersburg, Russia
- Keywords
- secure encryption protocol / small-size key / computationally difficult problem / cryptographic protocol / discrete logarithm problem / factoring problem / commutative encryption
- Year
- 2016 Issue 2 Pages 3 - 8
- Code EDN
- Code DOI
- Abstract
- Classical encryption algorithms provide a guaranteed data protection when using a specific key size, typically 256 bits. However, in practice there is a problem of guaranteed data protection within the constraints of key size. This paper considers the concept of constructing secure encryption protocols using small-size key and a method for construction of the cryptoschemes based on difficulty of simultaneous solving the factoring (FP) and the discrete logarithm modulo prime problem (DLpP). A new protocol for secure encryption with using small-size keys, which is based on difficulty of simultaneous solving the discrete logarithm and factorization problems, is proposed.
- Text
- To obtain access to full text of journal and articles you must register!
- Buy
