Yazar "Tutdere, Seher" için listeleme
-
Construction of arithmetic secret sharing schemes by using torsion limits
Tutdere, Seher; Uzunkol, Osmanbey (Hacettepe Univ, 2020)Cascudo, Cramer, and Xing [Torsion limits and Riemann-Roch systems for function fields and applications, IEEE Trans. Inf. Theory, 2014] gave a construction of arithmetic secret sharing schemes by using the torsion limits ... -
The covering radii of a class of binary cyclic codes and some BCH codes
Kavut, Selçuk; Tutdere, Seher (Springer, 2019)In 2003, Moreno and Castro proved that the covering radius of a class of primitive cyclic codes over the finite field F2 having minimum distance 5 (resp. 7) is 3 (resp. 5). We here give a generalization of this result as ... -
Highly nonlinear (Vectorial) Boolean functions that are symmetric under some permutations
Kavut, Selcuk; Tutdere, Seher (Amer Inst Mathematical Sciences-AIMS, 2020)We first give a brief survey of the results on highly nonlinear single-output Boolean functions and bijective S-boxes that are symmetric under some permutations. After that, we perform a heuristic search for the symmetric ... -
A key manipulation attack on some recent isogeny-based key agreement protocols
Gönen, Mehmet Emin; Tutdere, Seher; Uzunkol, Osmanbey (Springer Singapore Pte Ltd, 2021)Recently, Daghigh et al. proposed some isogeny-based key agreement protocols in Bull. Iran. Math. Soc. 43 (2017), no. 4, 77-88. They claimed that their key exchange protocols based on supersingular isogenies provide the ... -
On the batch outsourcing of pairing computations
Kalkar, Öznur; Sertkaya, İsa; Tutdere, Seher (Oxford Univ Press, 2022)Pairing-based cryptography is utilized in a wide range of devices, such as servers, mobile devices, smart cards and sensors. Pairing computation would be a burden for power and/or computation-restricted devices. Protocols ... -
On the covering radii of a class of binary primitive cyclic codes
Tutdere, Seher (Hacettepe Univ, 2022)In 2019, Kavut and Tutdere proved that the covering radii of a class of primitive binary cyclic codes with minimum distance greater than or equal to r + 2 is r, where r is an odd integer, under some assumptions. We here ...
