Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Nait-Abdesselam, Fadila"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Thumbnail Image
    Item
    On computing the double point multiplication in elliptic curve cryptography
    (Taylor & francis, 2025) Nait-Abdesselam, Fadila; Oudjida, Abdelkrim Kamel; Khouas, Abdelhakim; Liacha, Ahmed
    The double point-multiplication (DPM) operation on elliptic curves, denoted as u.P þ v.Q, where u and v are nonnegative integers and P, Q are points on the curve, is a critical operation in digital signature verification. Its computational scheme sig- nificantly impacts system performances in terms of speed, memory usage, and security. This article introduces a range of straightforward algorithms for DPM, which leverage an iterative uniform pattern based on constant-time arithmetic. This approach mitigates side-channel attacks (SCA) that exploit tim- ing or power consumption measurements to compromise secret keys u and v. The proposed algorithms employ a w-bit windowing method to simultaneously recode the binary strings u and v and evaluate DPM on-the-fly from left-to-right. This one-pass recode/evaluation process accelerates DPM, reduces memory overhead, and enhances resilience against SCA. The new algorithms are systematically evaluated using precise ana- lytic formulas for speed, memory usage, and security. They pri- oritize simplicity and flexibility, enabling easy adjustments between speed-memory and speed-security trade-offs to meet various constraints. Comparative analysis against state-of-the- art methods is conducted, comprehensively examining com- plexities using NIST-recommended GF(2l ) curves, as well as twisted Edwards and Montgomery GF(p) curves.

DSpace software copyright © 2002-2026 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify