A public key encryption scheme based on factoring and discrete logarithm

被引：5

作者：

Poulakis, Dimitrios ^{[1
]}

机构：

[1] Aristotle Univ Thessaloniki, Dept Math, Thessaloniki 54124, Greece

来源：

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY | 2009年 / 12卷 / 06期

关键词：

Public key cryptography; discrete logarithm; factorization; DRSA cryptosystem; ElGamal cryptosystem;

D O I：

10.1080/09720529.2009.10698270

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We present a cryptosystem which is a combination of the DRSA and ElGamal cryptosystems. Its security relies equally on the integer factorization and the discrete logarithm problems. We show that it is at least as secure as each of the DRSA and ElGamal cryptosystems (with messages from a subgroup) which are semantically secure.

引用

页码：745 / 752

页数：8

共 8 条

[1] PUBLIC-KEY CRYPTOSYSTEM DESIGN BASED ON FACTORING AND DISCRETE LOGARITHMS [J].

HARN, L .

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 1994, 141 (03) :193-195

[2]

LeVeque W.J., 1977, FUNDAMENTALS NUMBER

[3]

McCurley K. S., 1988, Journal of Cryptology, V1, P95, DOI 10.1007/BF02351718

[4] CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS [J].

Nitaj, Abderrahmane .

INTERNATIONAL JOURNAL OF NUMBER THEORY, 2009, 5 (02) :311-325

[5]

Pointcheval D, 1999, LECT NOTES COMPUT SC, V1592, P239

[6] The Pohlig-Hellman method generalized for group structure computation [J].

Teske, E .

JOURNAL OF SYMBOLIC COMPUTATION, 1999, 27 (06) :521-534

[7]

Tsiounis Y., 1998, LNCS, V1431, P117, DOI DOI 10.1007/BFB0054019

[8]

Wei W., 2004, TATRA MOUNTAINS MATH, V29, P147

← 1 →