most citedStrong Pseudo Primes to Base 2

3 citations · 6 across the 3 of their papers we have counts for

collaborators

5 papers

cs.CR20202 cited

A Polynomial Interpolation based Quantum Key Reconciliation Protocol: Error Correction without Information Leakage

Gunes Karabulut Kurt, Enver Ozdemir, Neslihan Aysen Ozkirisci +2

In this work, we propose a novel key reconciliation protocol for the quantum key distribution (QKD). Based on Newton's polynomial interpolation, the proposed protocol aims to corre…

cs.CR2019

Authentication and Hand-Over Algorithms for IoT Group

Yucel Aydin, Gunes Karabulut Kurt, Enver Ozdemır

Current advancements in mobility of devices and also Internet of Things (IoT) have replaced the central networks by distributed infrastructure. The more a network is distributed, t…

cs.CR2019

Authenticated Hand-Over Algorithm for Group Communication

Yucel Aydin, Gunes Karabulut Kurt, Enver Ozdemır

Shamir or Blakley secret sharing schemes are used for the authentication process in the studies before, but still secure group authentication and hand-over process remain as challe…

math.NT20193 cited

Strong Pseudo Primes to Base 2

Kubra Nari, Enver Ozdemir, Neslihan Aysen Ozkirisci

In this work, we add an additional condition to strong pseudo prime test to base 2. Then, we provide theoretical and heuristics evidences showing that the resulting algorithm catch…

math.NT20191 cited

Group Operation on Nodal Curves

Kubra Nari, Enver Ozdemir

In this work, we present an efficient method for computing in the Generalized Jacobian of special singular curves. The efficiency of the operation is due to representation of an el…