CoChat

The cryptanalysis of the Rabin public key algorithm using the Fermat factorization method

Open access
Budiman, M A, Rachmawati, D, Utami, R · 2019 · Journal of Physics: Conference Series

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Abstract

As a public key cryptography algorithm, the Rabin algorithm has two keys, i.e., public key (n) and private key (p, q). The security of Rabin algorithm relies on the difficulty of factoring very large numbers, so the greater the private keys are used, the better the security becomes. In order to test how hard it is to cryptanalyze the Rabin public key n, we use the Fermat factorization method to obtain the values of p and q. After obtaining the factors, both of these factors are tested whether or not they are in accordance with the Rabin private key requirements. The first is to test whether or not the factors are prime numbers using Fermat Little Theorem. The second is to test whether or not the factors are congruent to 3 in modulo 4. If the results of the two tests turn out to be positive, then the factors are indeed p and q, the private keys of the Rabin algorithm. The result of our experiment indicates that the value of public key n does not have a directly proportional correlation to the factoring time. A factor which may affect the factoring time is the difference between the private keys (p - q): the larger the difference, the longer the factoring time.

Overview

Integrity signals

Registry

Crossref · 10.1088/1742-6596/1235/1/012084

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 2 references

Research works printed but not linked: 2

  1. Srivastava, 2013, The Rabin Cryptosystem & Analysis in Measure of Chinese Reminder Theorem, 3
  2. Usman, 2015, New Factoring Algorithm: Prime Factoring Algorithm, 5, 75

Cited by

See all 4

Metadata

Authors
Budiman, M. A., Rachmawati, D., & Utami, R.
Affiliations
Universitas Sumatera Utara (ID)
Corresponding author
  • Rachmawati, D
  • Utami, R
Venue
Journal of Physics: Conference Series
Published
2019-06-01
Volume
1235
Issue
1
Pages
012084
ISSN
  • 1742-6588 (ISSN-L)
  • 1742-6596
OpenAlex
W2963364107
Cited by
4
References
2
Citations by year
2025: 1 · 2024: 1 · 2023: 1 · 2020: 1
FWCI
0.20
Type
conference paper
Language
en
Open access
Licence
Locations
Journal of Physics Conference Series (publishedVersion, cc-by)
Topics
  • Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
Keywords
Rabin cryptosystem, cryptanalysis, integer factorization, public-key cryptography, Fermat's little theorem, private key recovery

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: The cryptanalysis of the Rabin public key algorithm using the Fermat factorization method. https://app.cochat.ai/papers/10.1088/1742-6596/1235/1/012084
The paper
Budiman, M. A., Rachmawati, D., & Utami, R. (2019). The cryptanalysis of the Rabin public key algorithm using the Fermat factorization method. Journal of Physics: Conference Series. https://doi.org/10.1088/1742-6596/1235/1/012084

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.