Cited by 18Cryptographic Implementations and SecurityCryptography and Data SecurityComputer Science and Engineering

Systematic literature review: comparison study of symmetric key and asymmetric key algorithm

Open access
Santoso, Priasnyomo Prima, Rilvani, Elkin, Trisnawan, Ahmad Budi, Adiyarta, Krisna, Napitupulu, Darmawan, Sutabri, Tata, Rahim, Robbi·2018·IOP Conference Series: Materials Science and Engineering

Abstract

Cryptography is a science that studies how to keep data or messages safe when sent, from sender to recipient without interference from third parties. This paper presents a comparison of cryptographic algorithms of simetris keys and asymmetric keys. Cryptographic research related journals are collected and analyzed to find the correct comparison of cryptographic algorithms to implement. The results of this study, namely: symmetric and asymmetric keys have differences in the process of encryption and decryption. There are many cryptographic algorithms that can be applied to symmetric and asymmetric keys, but the selection and use of certain algorithms cannot be said to be forever the best because they depend on the circumstances encountered in developing the applied system.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/1757-899x/420/1/012111

Cites

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Symmetric encryption algorithms are low-cost and high-efficiency.

    “Symmetric encryption algorithms are low-cost and high-efficiency.”

    From Comparative performance analysis of hardware and software AES encryption implementation in WSN (2025) · cites this paper as [9]

    The Figure 1 passage says symmetric algorithms operate faster than asymmetric algorithms, and Results and Discussion says they perform well on speed and power consumption. These support high efficiency, but the passages do not establish that symmetric algorithms are low-cost. (LLM, conf=0.86)

    Experimental — accuracy not yet measured
  • Asymmetric encryption algorithms are complex and take more execution time than symmetric algorithms, but they deliver a higher level of security.

    “Asymmetric algorithms are complex and take more execution time, but they deliver a higher level of security.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

No references could be resolved yet.

Research works printed but not linked: 5

  1. Bisht N and Singh S, 2015, A Comparative Study of Some Symmetric and Asymmetric Key Cryptography Algorithms International Journal of Innovative Research in Science, Engineering and Technology4, 3 p. 1028-1031.
  2. Chandra S, 2014, A comparative survey of symmetric and asymmetric key cryptography in International Conference on Electronics, Communication and Computational Engineering p. 83-93.
  3. Gaithuru J, 2015, A Comprehensive Literature Review of Asymmetric Key Cryptography Algorithms for Establishment of the Existing Gap, Malaysian Software Engineering Conference p. 236-244.
  4. Tripathi R and Agrawal S, 2014, Comparative Study of Symmetric and Asymmetric Cryptography Techniques, International Journal of Advanced Foundation and Research in Computer1, 6 p. 68-76.
  5. Chandra S Bhattacharyya S Paira S and Alam S, 2014, A Study and Analysis on Symmetric Cryptography in International Conference on Science, Engineering and Management Research IEEEp. 1-9.

Cited by

Sorted by citations

Authors
Santoso, P. P., Rilvani, E., Trisnawan, A. B., Adiyarta, K., Napitupulu, D., Sutabri, T., & Rahim, R.
Affiliations
  • Universitas Budi Luhur (ID)
  • Indonesian Institute of Sciences (ID)
  • Universitas Respati Indonesia (ID)
  • Universiti Malaysia Perlis (MY)
Corresponding author
  • Rilvani, Elkin
  • Trisnawan, Ahmad Budi
  • Adiyarta, Krisna
  • Sutabri, Tata
  • Rahim, Robbi
Venue
IOP Conference Series: Materials Science and Engineering
Published
2018-10-01
Volume
420
Pages
012111
ISSN
  • 1757-8981 (ISSN-L)
  • 1757-899X
OpenAlex
W2895342297
Cited by
18
References
0
Citations by year
2025: 5 · 2024: 4 · 2023: 3 · 2022: 3 · 2021: 1 · 2020: 2
FWCI
0.09
Type
journal article
Language
en
Open access
Locations
IOP Conference Series Materials Science and Engineering (publishedVersion, cc-by)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
Keywords
symmetric encryption, public-key cryptography, cryptographic algorithms, encryption and decryption, algorithm selection, data 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