Cryptoschemes Based on Difficulty of Simultaneous Solving Two Different Difficult Problems

Cryptoschemes Based on Difficulty of Simultaneous Solving Two Different Difficult Problems

The paper proposes a general method for construction cryptoschemes based on difficulty of simultaneous solving factoring (FP) and discrete logarithm modulo prime problem (DLpP). The proposed approach is applicable for construction digital signatures (usual, blind, collective), public key encryption...

Full description

Bibliographic Details
Main Authors: A.N. Berezin, N.A. Moldovyan, V.A. Shcherbacov
Format: Article
Language:English
Published: Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova 2013-10-01
Series:Computer Science Journal of Moldova
Subjects:
Cryptosystem
cryptographic protocol
digital signature
public encryption
factorization problem
discrete logarithm problem
integrated security parameter
Online Access:http://www.math.md/files/csjm/v21-n2/v21-n2-(pp280-290).pdf

Internet

http://www.math.md/files/csjm/v21-n2/v21-n2-(pp280-290).pdf

Similar Items