Cited by 31Cryptography and Residue ArithmeticAdvanced Authentication Protocols SecurityCryptographic Implementations and Security

Performance evaluation of public-key cryptosystem operations in WTLS protocol

Levi, A., Savas, E.·2004·Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003

Abstract

WTLS (wireless transport layer security) is an important standard protocol for secure wireless access to Internet services. WTLS employs public-key cryptosystems during the handshake between mobile client and WAP gateway (server). Several cryptosystems at different key strengths can be used in WTLS. The trade-off is security versus processing and transmission time. In this paper, an analytical performance model for public-key cryptosystem operations in WTLS protocol is developed. Different handshake protocols, different cryptosystems and key sizes are considered. Public-key cryptosystems are implemented using state-of-the-art performance improvement techniques, yielding actual performance figures for individual cryptosystems. These figures and the analytical model are used to calculate the cost of using public-key cryptosystems in WTLS. Results for different cryptosystems and handshake protocols are comparatively depicted and interpreted. It has been observed that ECC (elliptic curve cryptography) performs better than its rival RSA cryptosystem in WTLS. Performance of some stronger ECC curves, which are not considered in WTLS standard, is also analyzed. Results showed that some of those curves could be used in WTLS for high security applications with an acceptable degradation in performance.

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.1109/iscc.2003.1214285

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?

  • Elliptic Curve Cryptography (ECC) represents a much lighter alternative to RSA.

    “In contrast, Elliptic Curve Cryptography (ECC) represents a much lighter alternative to RSA [111], [112].”

    From A Review on the Use of Blockchain for the Internet of Things (2018) · cites this paper as [111]

Self-check

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

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

Cited by

Sorted by citations

Authors
Levi, A., & Savas, E.
Affiliations
Sabancı Üniversitesi (TR)
Venue
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003
Published
2004-03-22
Pages
1245-1250
ISSN
1530-1346 (ISSN-L)
OpenAlex
W2128660573
Cited by
31
References
0
Citations by year
2022: 3 · 2021: 1 · 2020: 1 · 2019: 2 · 2018: 1 · 2017: 4 · 2016: 2 · 2015: 3 · 2014: 1 · 2012: 1
FWCI
1.96
Type
conference paper
Language
en
Open access
closed
Locations
IEEE Symposium on Computers and Communications (ISCC) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
  • Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
Keywords
WTLS, public-key cryptography, elliptic curve cryptography, handshaking, key size, performance modeling, wireless network security, WAP gateway, security-performance trade-off

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