The DOI matches its Crossref record.
On Using The First Variant of Dependent RSA Encryption Scheme to Secure Text: A Tutorial
Open accessAbstract
Abstract The Rivest-Shamir-Adleman (RSA) public key cryptosystem has been extensively used to secure digital communication since more than forty years. The security of RSA relies on the hardness of factoring a big integer into its two big prime factors: the bigger the integer, the securer the cryptosystem. However, the RSA cryptosystem is proven to be not semantically secure. Some variants of Dependent RSA encryption schemes have been introduced by Pointcheval to overcome this problem. This study shows how the first variant of Dependent RSA (DRSA-1) encryption scheme is used to secure text. All algorithms have been implemented in the Python programming language version 2.7.15.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“It also outperformed AES, DES, and RSA in encryption quality as evidenced by the higher PSNR and SSIM values.”
From Image Encryption Algorithm Combining Chaotic Image Encryption and Convolutional Neural Network (2023) · cites this paper as [44]
Experimental — accuracy not yet measured
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
No references could be resolved yet.
Research works printed but not linked: 9
- Rachmawati, 2017, An implementation of the H-Rabin algorithm in the Shamir three-pass protocol, 10.1109/ICACOMIT.2017.8253381 · DOI
- Wang, 2016, Secure searchable encryption: a survey, Journal of Communications and Information Networks, 1, 52, 10.1007/BF03391580 · DOI
- Diffie, 1976, New directions in cryptography, IEEE Transactions on Information Theory, 22, 644, 10.1109/TIT.1976.1055638 · DOI · Paper page
- Hellman, 2002, An overview of public key cryptography, IEEE Communications Magazine, 40, 42, 10.1109/MCOM.2002.1006971 · DOI
- Rivest, 1978, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, 21, 120, 10.1145/359340.359342 · DOI · Paper page
- Padhye, 2006, On DRSA public key cryptosystem, International Arab Journal of Information Technology, 3, 334
- Goldwasser, 1982, Probabilistic encryption & how to play mental poker keeping secret all partial information, 10.1145/800070.802212 · DOI
- Goldwasser, 1984, Probabilistic encryption, Journal of Computer and System Sciences, 28, 270, 10.1016/0022-0000(84)90070-9 · DOI
- Iliev, 2018, A Note on Adaptation of the Knuth’s Extended Euclidean Algorithm for Computing Multiplicative Inverse, International Journal of Pure and Applied Mathematics, 118, 281
Cited by
Sorted by citations
Image Encryption Algorithm Combining Chaotic Image Encryption and Convolutional Neural Network
Feng, L., Du, J., Fu, C., & Song, W. (2023) · Electronics · doi:10.3390/electronics12163455 · Cited by 58
Metadata
- Authors
- Rachmawati, D., & Budiman, M. A.
- Affiliations
- Universitas Sumatera Utara (ID)
- Corresponding author
- Rachmawati, D
- Venue
- Journal of Physics: Conference Series
- Publisher
- IOP Publishing
- Published
- 2020-05-01
- Volume
- 1542
- Issue
- 1
- Pages
- 012024
- ISSN
- 1742-6588 (ISSN-L)
- 1742-6596
- OpenAlex
- W3038252982
- Cited by
- 11
- References
- 0
- Citations by year
- 2026: 2 · 2025: 3 · 2024: 3 · 2023: 3
- FWCI
- 0.29
- Type
- conference paper
- Language
- en
- Open access
- diamond
- doi.org
- Licence
- Locations
- Journal of Physics Conference Series (publishedVersion, cc-by)
- Funders
- Universitas Sumatera Utara (4167/UN5.1.R/PPM/2019, 4167/UN5.1.R/PPM)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- RSA encryption, public-key cryptography, semantic security, integer factorization, text encryption
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On Using The First Variant of Dependent RSA Encryption Scheme to Secure Text: A Tutorial. https://app.cochat.ai/papers/10.1088/1742-6596/1542/1/012024
- The paper
- Rachmawati, D., & Budiman, M. A. (2020). On Using The First Variant of Dependent RSA Encryption Scheme to Secure Text: A Tutorial. Journal of Physics: Conference Series. https://doi.org/10.1088/1742-6596/1542/1/012024
