On a Vernam cipher scheme based on elliptic curve L-functions

被引：1

作者：

Omar, Sami ^{[1
]}

Eid, Abdulla ^{[1
]}

机构：

[1] Univ Bahrain, Dept Math, POB 32038, Sukhair, Bahrain

来源：

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY | 2024年 / 27卷 / 01期

关键词：

Elliptic curves; L-functions; LCGs; Vernam cipher;

D O I：

10.47974/JDMSC-1638

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, we present a new Vernam-like cryptosystem based on the L-functions attached to elliptic curves. Actually, we show that for infinitely many elliptic curves, the coefficients of the L-series can be considered as a secure cryptographic cipher key when combined with linear and classical pseudo-random number generators. Hence, fast and widely known classical generators, like linear congruential generators, should be reintroduced into our list of cryptographic design choices.

引用

页码：151 / 174

页数：24

共 27 条

[1] Abdalla M, 2001, LECT NOTES COMPUT SC, V2020, P143
[2] [Anonymous], 2011, Encyclopedia of Cryptography and Security, DOI DOI 10.1007/978-3-540-88702-75
[3] Zeta functions, one-way functions, and pseudorandom number generators
Anshel, M
Goldfeld, D
[J]. DUKE MATHEMATICAL JOURNAL, 1997, 88 (02) : 371 - 390
[4] Anyanwu M.N., 2009, INT J COMPUTER SCI S, V3, P186
[5] Becker A., 2013, IACR Cryptology ePrint Archive
[6] Bellare M, 1997, LECT NOTES COMPUT SC, V1294, P277
[7] INFERRING SEQUENCES PRODUCED BY PSEUDO-RANDOM NUMBER GENERATORS
BOYAR, J
[J]. JOURNAL OF THE ACM, 1989, 36 (01) : 129 - 141
[8] Brown D., 2008, Submission to NIST
[9] Canetti R, 1997, LECT NOTES COMPUT SC, V1294, P90
[10] Cremona J.E., 1997, ALGORITHMS MODULAR E

← 1 2 3 →