A public key cryptosystem and signature scheme based on numerical series
Open accessThe DOI matches its Crossref record; 28 of the 29 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
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
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 · cited 1×
“Cryptosystems that are based on factoring large integers are the RSA cryptosystem that was described by Rivest–Shamir–Adleman [2] and probabilistic ciphering system that was described by Goldwasser and Micali [3].”
MethodA 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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059 · cited 1×
“Taher ElGamal described a public crypto-system and signature scheme based on the difficulty of computing discrete logarithms in [7].”
MethodGoldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Evaluating 2-DNF Formulas on Ciphertexts
Boneh, D., Goh, E.-J., & Nissim, K. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_18 · Cited by 1,692 · cited 1×
“Cryptosystems that are based on the difficulty of computing the n th residue classes are Paillier ciphering scheme described in [4], BGN described in [5] by Boneh–Goh–Nissim and Okamoto–Uchiyama in [6] which resembled the Paillier ciphering scheme.”
MethodProbabilistic encryption & how to play mental poker keeping secret all partial information
Goldwasser, S., & Micali, S. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802212 · Cited by 883
A new public-key cryptosystem as secure as factoring
Okamoto, T., & Uchiyama, S. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054135 · Cited by 673
Bernstein, D. J., Birkner, P., Jóye, M., Lange, T., & Peters, C. (2008) · Springer eBooks · doi:10.1007/978-3-540-68164-9_26 · Cited by 364 · cited 1×
“In [20], Bernstein, released a key exchange protocol referred to as, Curve25519 that is an elliptic curve Diffie–Hellman key exchange protocol to establish a shared secret.”
BackgroundConverting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
Freeman, D. M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_3 · Cited by 305 · cited 1×
“In [9] Freeman used prime-order elliptic curve groups to construct secure pairing-based cryptosystem.”
MethodDifferential and Integral Calculus.
Lowenstein, L. L., Neelley, J. H., & Tracey, J. I. (1939) · American Mathematical Monthly · doi:10.2307/2303211 · Cited by 177
Dubey, A. K., Dubey, A. K., Namdev, M., & Shrivastava, S. S. (2012) · CSI International Conference on Software Engineering (CONSEG) · doi:10.1109/conseg.2012.6349503 · Cited by 97 · cited 1×
“In [16], Ashutosh Kumar Dubey et al. proposed a novel cloud-user security method which is based on RSA cryptography and MD5 for resource attestation and sharing in java environment.”
MethodA Hybrid Encryption Algorithm Based on DES and RSA in Bluetooth Communication
Ren, W., & Miao, Z. (2010) · doi:10.1109/wmsvm.2010.48 · Cited by 80
Integrating Diffie–Hellman Key Exchange into the Digital Signature Algorithm (DSA)
Harn, L., Mehta, M., & Hsin, W. (2004) · IEEE Communications Letters · doi:10.1109/lcomm.2004.825705 · Cited by 61 · cited 1×
“In [19], Harn et al. proposed an enhanced integration of the Diffie–Helman and DSA for key exchange by providing three round protocols.”
MethodHigh speed implementation of RSA algorithm with modified keys exchange
Nagar, S. A., & Alshamma, S. (2012) · International Conference on Sciences of Electronics, Technologies of Information and Telecommunications · doi:10.1109/setit.2012.6481987 · Cited by 53
Modified RSA cryptosystem based on offline storage and prime number
Patidar, R., & Bhartiya, R. (2013) · IEEE International Conference on Computational Intelligence and Computing Research (ICCIC) · doi:10.1109/iccic.2013.6724176 · Cited by 50
Integrating a key distribution procedure into the digital signature standard
Arazi, B. (1993) · Electronics Letters · doi:10.1049/el:19930643 · Cited by 41
Algorithms for Lightweight Key Exchange
Álvarez, R., Caballero‐Gil, C., Santonja, J., & Zamora, A. (2017) · Sensors · doi:10.3390/s17071517 · Cited by 41 · cited 1×
“In [24], Alvarez et al. showed that standard Diffie–Hellman is little slower than the elliptic curve variants in key pair generation and much slower than elliptic curve invariants in secure key exchange.”
BackgroundRSA algorithm using modified subset sum cryptosystem
Sharma, S., Sharma, P., & Dhakar, R. S. (2011) · International Conference on Computer and Communication Technology · doi:10.1109/iccct.2011.6075138 · Cited by 39
Enhanced diffie-hellman algorithm for reliable key exchange
Aryan, Kumar, C., & Vincent, P. M. D. R. (2017) · IOP Conference Series Materials Science and Engineering · doi:10.1088/1757-899x/263/4/042015 · Cited by 32 · cited 1×
“In [25], Kumar et al. proposed an enhanced Diffie–Hellman algorithm for reliable key exchange by employing the concept of primitive roots.”
A novel approach for secure and fast generation of RSA public and private keys on SmartCard
Bahadori, M., Mali, M. R., Sarbishei, O., Atarodi, M., & Sharifkhani, M. (2010) · IEEE Interregional NEWCAS Conference (NEWCAS) · doi:10.1109/newcas.2010.5603937 · Cited by 27 · cited 1×
“In [10], Bahadori et al. proposed a method to speed up a secure generation of RSA public and private key values that are equipped on smart cards.”
MethodSurvey on Public Key Cryptography Scheme for Securing Data in Cloud Computing
Athena, J., & Sumathy, V. (2017) · Circuits and Systems · doi:10.4236/cs.2017.83005 · Cited by 20 · cited 1×
“Athena et al. introduced elliptic curve cryptography (ECC) uses the properties of elliptic curves to generate keys in [8].”
MethodDifferential and Integral Calculus
Batschelet, E. (1975) · Springer eBooks · doi:10.1007/978-3-642-96270-7_9 · Cited by 15
Four$$\mathbb {Q}$$NEON: Faster Elliptic Curve Scalar Multiplications on ARM Processors
Longa, P. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-69453-5_27 · Cited by 11
FourQNEON: Faster Elliptic Curve Scalar Multiplications on ARM Processors.Preprint
Longa, P. (2016) · IACR Cryptology ePrint Archive · Cited by 8
Efficient Authenticated Key-Exchange for Devices with a Trusted Manager
Ge, H., & Tate, S. R. (2006) · International Conference on Information Technology: New Generations · doi:10.1109/itng.2006.57 · Cited by 7
Certification of secure RSA keys
Blackburn⋆, S. R., & Galbraith⋆, S. D. (2000) · Electronics Letters · doi:10.1049/el:20000035 · Cited by 4
Research works printed but not linked: 4
- Goldwasser S, Micali S (1982) Probabilistic ciphering and how play mental poker keeping secret all partial information. In: Proceedings of 14th symposium on theory of computing, pp 365–377
- Paillier P (1999) Public key cryptosystem based on composite residue classes. In: Proceedings of advances in cryptology, EUROCRYPT99, pp 223–238
- Chou T (2015) Fastest Curve25519 implementation ever. In: Proceedings of the workshop on elliptic curve cryptography standards, Gaithersburg, MD, USA
- Costello C, Longa P (2015) FourQ: four-dimensional decompositions on a Q-curve over the Mersenne prime. In: Proceedings of the international conference on the theory and application of cryptology and information security, Kaoshiung, Taiwan. Springer, Berlin, pp 214–235
Cited by
A survey on digital signature schemes
Mohammed, Q. A. A.-S., Joudah, M., & mohammed, H. J. (2024) · AIP conference proceedings · doi:10.1063/5.0236576 · Cited by 8
Silva-Garcia, V. M., Flores-Carapia, R., Gonzalez-Ramirez, M. D., Vega-Alvarado, E., & Villarreal-Cervantes, M. G. (2020) · IEEE Access · doi:10.1109/access.2020.3042475 · Cited by 7
“Also, using the elliptic curve and the value of the Sha-512 function it is possible that the sender signs the information, applying the Elliptic Curve Signature Algorithm - ECSA [57].”
MethodCancelable Multibiometrics Template Security Using Deep Binarization and Secure Hashing
Singh, A., & Singh, Y. N. (2023) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001423560074 · Cited by 6
An Optimized Key Schedule Algorithm of PRESENT-128 Using Elliptic Curve Cryptosystem
Al-Sharaeh, S. H., Al-Fakiat, W. H., & Albasheer, M. Z. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-86637-1_18 · Cited by 1
Gurunathan, K., Parthasarathy, S. M., & Srinivasan, S. (2025) · IEEE International Conference on ICT in Business Industry & Government (ICTBIG) · doi:10.1109/ictbig68706.2025.11323597
“RSA is secure due to the difficulty of factoring big prime numbers, and ECC is secure due to the infeasibility of calculating elliptic curve discrete logarithms [5-7].”
Metadata
- Authors
- Nagaty, K. A.
- Affiliations
- British University in Egypt (EG)
- Corresponding author
- Nagaty, Khaled A.
- ORCID
- Nagaty, Khaled A.
- Venue
- SN Applied Sciences
- Published
- 2020-01-01
- Volume
- 2
- Issue
- 2
- ISSN
- 2523-3963 (ISSN-L)
- 2523-3971
- OpenAlex
- W2997425370
- Cited by
- 5
- References
- 29
- Citations by year
- 2025: 2 · 2024: 1 · 2023: 1 · 2020: 1
- FWCI
- 0.20
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.springer.com/tdm (tdm)
- www.springer.com/tdm (vor)
- Locations
- SN Applied Sciences (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
- Keywords
- public-key cryptosystems, digital signatures, partial sums, forward secrecy, cryptographic hash functions, online document signing, computational efficiency
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.