A public key cryptosystem and a signature scheme based on discrete logarithms
Abstract
A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The optimal number of clusters in terms of energy consumption and performance for a group of 100 nodes is 10.
“The selection of the number of clusters is based on the work by [68], according to which the optimal number of clusters in terms of energy consumption and performance for a group of 100 nodes is 10.”
From Lightweight blockchain for healthcare (2019) · cites this paper as [68]
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713 · see citing works
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · see citing works
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012 · see citing works
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199 · see citing works
Discrete logarithms in finite fields and their cryptographic significance
Odlyzko, A. M. (2007) · Springer eBooks · doi:10.1007/3-540-39757-4_20 · Cited by 367 · see citing works
Fast evaluation of logarithms in fields of characteristic two
Coppersmith, D. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056941 · Cited by 298 · see citing works
A subexponential algorithm for the discrete logarithm problem with applications to cryptography
Adleman, L. M. (1979) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1979.2 · Cited by 239 · see citing works
An efficient signature scheme based on quadratic equations
Ong, H., Schnorr, C. P., & Shamir, A. (1984) · doi:10.1145/800057.808683 · Cited by 84 · see citing works
A Monte Carlo factoring algorithm with linear storage
Schnorr, C. P., & Lenstra, H. W. (1984) · Mathematics of Computation · doi:10.1090/s0025-5718-1984-0744939-5 · Cited by 73 · see citing works
A subexponential-time algorithm for computing discrete logarithms overGF(p^2)
ElGamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057075 · Cited by 56 · see citing works
Self-citationSignatures Through Approximate Representations by Quadratic Forms
Ong, H., & Schnorr, C. P. (1984) · Springer eBooks · doi:10.1007/978-1-4684-4730-9_10 · Cited by 22 · see citing works
A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2)
ElGamal, T. (1984) · Springer eBooks · doi:10.1007/978-1-4684-4730-9_22 · Cited by 10 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250 · see citing works
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806 · see citing works
Koblitz, N. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866109-5 · Cited by 5,634 · see citing works
The Arithmetic of Elliptic Curves
Silverman, J. H. (1986) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-1920-8 · Cited by 4,044 · see citing works
A Survey on Homomorphic Encryption Schemes: Theory and Implementation
Acar, A., Aksu, H., Uluagac, A. S., & Conti, M. (2019) · ACM Computing Surveys · doi:10.1145/3214303 · Cited by 1,397 · see citing works
Verifynet: Secure and verifiable federated learning
Xu, G., Li, H., Liu, S., Yang, K., & Lin, X. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2019.2929409 · Cited by 839 · see citing works
Yin, X., Zhu, Y., & Hu, J. (2022) · ACM Computing Surveys · doi:10.1145/3460427 · Cited by 638 · see citing works
Data security and privacy-preserving in edge computing paradigm: survey and open issues
Zhang, J., Chen, B., Zhao, Y., Cheng, X., & Hu, F. (2018) · IEEE Access · doi:10.1109/access.2018.2820162 · Cited by 514 · see citing works
Security services using blockchains: a state of the art survey
Salman, T., Zolanvari, M., Erbad, A., Jain, R., & Samaka, M. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2863956 · Cited by 502 · see citing works
Privacy and Robustness in Federated Learning: Attacks and Defenses
Lyu, L., Yu, H., Ma, X., Chen, C., Sun, L., Zhao, J., Yang, Q., & Yu, P. S. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3216981 · Cited by 548 · see citing works
Secure audit logs to support computer forensics
Schneier, B., & Kelsey, J. (1999) · ACM Transactions on Information and System Security · doi:10.1145/317087.317089 · Cited by 443 · see citing works
Security for Industrial Communication Systems
Dzung, D., Naedele, M., Von Hoff, T. P., & Crevatin, M. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2005.849714 · Cited by 386 · see citing works
Towards secure mobile cloud computing: a survey
Khan, A. N., Mat Kiah, M. L., Khan, S. U., & Madani, S. A. (2013) · Future Generation Computer Systems · doi:10.1016/j.future.2012.08.003 · Cited by 368 · see citing works
Federated learning in a medical context: A systematic literature review
Pfitzner, B., Steckhan, N., & Arnrich, B. (2021) · ACM Transactions on Internet Technology · doi:10.1145/3412357 · Cited by 288 · see citing works
A Systematic Review of Homomorphic Encryption and Its Contributions in Healthcare Industry
Munjal, K., & Bhatia, R. (2023) · Complex & Intelligent Systems · doi:10.1007/s40747-022-00756-z · Cited by 269 · see citing works
Lightweight blockchain for healthcare
Ismail, L., Materwala, H., & Zeadally, S. (2019) · IEEE Access · doi:10.1109/access.2019.2947613 · Cited by 260 · see citing works
Towards Fair and Privacy-Preserving Federated Deep Models
Lyu, L., Yu, J., Nandakumar, K., Li, Y., Ma, X., Jin, J., Yu, H., & Ng, K. S. (2020) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.2996273 · Cited by 250 · see citing works
Information Sharing for Supply Chain Management Based on Block Chain Technology
Nakasumi, M. (2017) · 2017 IEEE 19th Conference on Business Informatics (CBI) · doi:10.1109/cbi.2017.56 · Cited by 251 · see citing works
PPFA: Privacy Preserving Fog-Enabled Aggregation in Smart Grid
Lyu, L., Nandakumar, K., Rubinstein, B., Jin, J., Bedo, J., & Palaniswami, M. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2803782 · Cited by 240 · see citing works
Ullah, S., Zheng, J., Din, N., Hussain, M. T., Ullah, F., & Yousaf, M. (2023) · Computer Science Review · doi:10.1016/j.cosrev.2022.100530 · Cited by 195 · see citing works
Homomorphic Encryption for Machine Learning in Medicine and Bioinformatics
Wood, A., Najarian, K., & Kahrobaei, D. (2021) · ACM Computing Surveys · doi:10.1145/3394658 · Cited by 179 · see citing works
An Optimized Consortium Blockchain for Medical Information Sharing
Du, M., Chen, Q., Chen, J., & Ma, X. (2021) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2020.2966832 · Cited by 140 · see citing works
Quantum resistant public key cryptography: a survey
Perlner, R. A., & Cooper, D. A. (2009) · Proceedings of the 8th Symposium on Identity and Trust on the Internet · doi:10.1145/1527017.1527028 · Cited by 137 · see citing works
Privacy-preserving neural networks with Homomorphic encryption: Challenges and opportunities
Pulido-Gaytan, B., Tchernykh, A., Cortés-Mendoza, J. M., Babenko, M., Radchenko, G., Avetisyan, A., & Drozdov, A. Y. (2021) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-021-01076-8 · Cited by 126 · see citing works
Privacy-preserving and communication-efficient federated learning in Internet of Things
Fang, C., Guo, Y., Hu, Y., Ma, B., Feng, L., & Yin, A. (2021) · Computers & Security · doi:10.1016/j.cose.2021.102199 · Cited by 93 · see citing works
Quantum reversible circuit of AES-128
Almazrooie, M., Samsudin, A., Abdullah, R., & Mutter, K. N. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1864-3 · Cited by 75 · see citing works
Energy-efficient mechanisms in security of the internet of things: A survey
Hellaoui, H., Koudil, M., & Bouabdallah, A. (2017) · Computer Networks · doi:10.1016/j.comnet.2017.08.006 · Cited by 61 · see citing works
Froelicher, D., Troncoso-Pastoriza, J. R., Sousa, J. S., & Hubaux, J.-P. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2020.2976612 · Cited by 59 · see citing works
On Security in Publish/Subscribe Services: A Survey
Esposito, C., & Ciampi, M. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2364616 · Cited by 55 · see citing works
Drive-By Key-Extraction Cache Attacks from Portable Code
Genkin, D., Pachmanov, L., Tromer, E., & Yarom, Y. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-93387-0_5 · Cited by 57 · see citing works
Kumari, K. A., Sharma, A., Chakraborty, C., & Ananyaa, M. (2022) · Big Data · doi:10.1089/big.2021.0012 · Cited by 36 · see citing works
A Survey on Secure Computation Based on Homomorphic Encryption in Vehicular Ad Hoc Networks
Sun, X., Yu, F. R., Zhang, P., Xie, W., & Peng, X. (2020) · Sensors · doi:10.3390/s20154253 · Cited by 23 · see citing works
A public key cryptosystem and signature scheme based on numerical series
Nagaty, K. A. (2020) · SN Applied Sciences · doi:10.1007/s42452-019-1928-8 · Cited by 5 · see citing works
Cipher image damage and decisions in real time
Silva-García, V. M., Flores-Carapia, R., Rentería-Márquez, C., Luna-Benoso, B., Jiménez-Vázquez, C. A., & González-Ramírez, M. D. (2015) · Journal of Electronic Imaging · doi:10.1117/1.jei.24.1.013012 · Cited by 5 · see citing works
Cipher Image Damage: An Application of Filters
Flores-Carapia, R., Silva-García, V. M., Luna-Benoso, B., & Rentería-Márquez, C. (2015) · Polibits · doi:10.17562/pb-52-7 · Cited by 1 · see citing works
- Authors
- Elgamal, T.
- Affiliations
- Hewlett-Packard (United States) (US)
- Corresponding author
- Elgamal, T.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1985-07
- Volume
- 31
- Issue
- 4
- Pages
- 469-472
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2108834246
- Cited by
- 8,059
- References
- 12
- Citations by year
- 2026: 134 · 2025: 274 · 2024: 302 · 2023: 311 · 2022: 324 · 2021: 343 · 2020: 349 · 2019: 327 · 2018: 290 · 2017: 318 · 2016: 308 · 2015: 335 · 2014: 331 · 2013: 371 · 2012: 359
- FWCI
- 8.53
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
- Keywords
- public-key cryptosystems, digital signatures, discrete logarithm problem, finite fields, cryptographic security
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review