Eğrice, Berkan

Profile Picture
Profile URL
https://gcris.yasar.edu.tr/handle/123456789/12812
Name Variants
Job Title
Araş.Gör.
Email Address
Main Affiliation
01. Yaşar Üniversitesi
Status
Former Staff
Website
ORCID ID
0000-0003-3968-9434
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

SDG data is not available
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

2

Articles

1

Views / Downloads

0/0

Supervised MSc Theses

1

Supervised PhD Theses

0

WoS Citation Count

0

Scopus Citation Count

0

Patents

0

Projects

0

WoS Citations per Publication

0.00

Scopus Citations per Publication

0.00

Open Access Source

1

Supervised Theses

1

JournalCount
International Journal of Information Security Science1
Current Page: 1 / 1

Scopus Quartile Distribution

Quartile distribution chart data is not available

Competency Cloud

GCRIS Competency Cloud

Filters

20222
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 2 of 2
  • 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.
  • Thumbnail Image
    Master Thesis
    Hız odaklı eliptik eğri skaler çarpma işlemi
    (2022) Eğrice, Berkan; Hışıl, Hüseyin
    Because of the increasing importance of cyber security in today's world, modern cryptographic applications is to be secure and fast. The aim of thesis is to explore secure and fast implementation techniques of elliptic curve scalar multiplication, the main performance bottleneck of implementations in Elliptic Curve Cryptography. The studies cover two main streams of work. The first one is to pinpoint primes which can be used to provide maximum speed. The other is to develop parallel versions of celebrated Montgomery ladder algorithm. In order to achieve the first aim, a mathematical framework that will parameterize fast primes is proposed. With the help of this framework, the overlooked prime 2^261-2^131-1 which allows fast multiplication is found. It is shown with our implementation that this new prime performs faster than the popular primes 2^251-9 and 2^255-19, which makes it a good candidate for efficient implementations. In addition, a 9-limb representation of the prime 2^255-19 is developed. The new representation performs well on processors with slower integer multiplication circuits. In order to achieve the second aim, the first 4-way parallel version of the Montgomery ladder algorithm is proposed. The proposed algorithm is inert to changes in the elliptic curve parameters such as curve constants and the base point. This makes it a perfect candidate for variable-base variable-scalar multiplication. The algorithm finds immediate application in the contemporary SIMD processors.