Repository logoGCRIS
  • English
  • Türkçe
  • Русский
Log In
New user? Click here to register. Have you forgotten your password?
Home
Communities
Browse GCRIS
Entities
Overview
GCRIS Guide
  1. Home
  2. Browse by Author

Browsing by Author "Yassi, Mert"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    Article
    Fast 4 way vectorized ladder for the complete set of Montgomery curves
    (2022) HUSEYIN HISIL; Berkan Eğrice; Mert Yassi; Eğrice, Berkan; Yassi, Mert; Hısıl, Huseyın
    This paper introduces 4 way vectorization of Montgomery ladder on any Montgomery form elliptic curve. Our algorithm\rtakes 2M4 + 1S\r4\r(M4\r: A vector of four field multiplications S\r4\r: A vector of four field squarings) per ladder step for variable-scalar\rvariable-point multiplication. This is a theoretical improvement over the squared Kummer ladder which takes 2M4 + 1S\r4 + 1d\r4\rper\rladder step. This paper also introduces new formulas for doing arithmetic over GF(2255 − 19). We provide two implementations\rof curve25519 using our proposed algorithm. The first implementation uses AVX2 instruction set and takes 98484 cycles. This\ris competitive with the current speed record of 95437 cycles by Nath and Sarkar. The second implementation uses AVX-512\rinstruction set and takes 74368 cycles. This sets the new speed record over Faz-Hernandez L ´ opez and Dahab’s implementation ´\rwhich takes 81600 cycles.
Repository logo
Collections
  • Scopus Collection
  • WoS Collection
  • TrDizin Collection
  • PubMed Collection
Entities
  • Research Outputs
  • Organizations
  • Researchers
  • Projects
  • Awards
  • Equipments
  • Events
About
  • Contact
  • GCRIS
  • Research Ecosystems
  • Feedback
  • OAI-PMH

Log in to GCRIS Dashboard

GCRIS Mobile

Download GCRIS Mobile on the App StoreGet GCRIS Mobile on Google Play

Powered by Research Ecosystems

  • Privacy policy
  • End User Agreement
  • Feedback