Oğuz Yayla

E-mail

oguz@metu.edu.tr

Department

Graduate School of Applied Mathematics

ORCID

0000-0001-8945-2780

Scopus Author ID

55317276200

Web of Science Researcher ID

AAZ-7675-2020

Families of sequences with good family complexity and cross-correlation measure Doğan, Kenan; ŞAHİN, MURAT; Yayla, Oğuz (2025-01-01) In this paper, we examine the pseudorandomness of a family of sequences with respect to two key measures: family complexity (f-complexity) and cross-correlation measure of order ℓ. Our study encompasses sequences over both...
Distributed Verifiable Random Function with Compact Proof Ağırtaş, Ahmet Ramazan; Özer, Arda Buğra; Saygı, Zülfükar; Yayla, Oğuz (2025-01-01) Verifiable Random Functions (VRFs) are cryptographic primitives that generate unpredictable randomness along with proofs that are verifiable, a critical requirement for blockchain applications in decentralized finance, onl...
Compartment-Based and Hierarchical Threshold Delegated Verifiable Accountable Subgroup Multi-signatures Ağırtaş, Ahmet Ramazan; Yayla, Oğuz (2025-01-01) In this paper, we study the compartment-based and hierarchical delegation of signing power of the verifiable accountable subgroup multi-signature (vASM). ASM is a multi-signature in which the participants are accountable f...
Design and Implementation of a Fast, Platform-Adaptive, AIS-20/31 Compliant PLL-Based True Random Number Generator on a Zynq 7020 SoC FPGA Yayla, Oğuz; Yılmaz, Yunus Emre (2024-01-01) Phase-locked loops (PLLs) integrated within field-program-mable gate arrays (FPGAs) or System-on-Chip FPGAs (SoCs) represent a promising approach for generating random numbers. Their widespread deployment, isolated functio...
On a group under which symmetric Reed–Muller codes are invariant Toplu, Sibel Kurt; ARIKAN, TALHA; AYDOĞDU, PINAR; Yayla, Oğuz (2024-1-01) The Reed–Muller codes are a family of error-correcting codes that have been widely studied in coding theory. In 2020, Yan and Lin introduced a variant of Reed–Muller codes called symmetric Reed–Muller codes. We investigate...
Methods for Masking CRYSTALS-Kyber Against Side-Channel Attacks ÖZEREN, SILA; Yayla, Oğuz (2023-12-11)
Butson-Hadamard matrices and Plotkin-optimal codes over DOUBLE-STRUCK CAPITAL Z(pe) Acar, Damla; SARAÇ, BÜLENT; Yayla, Oğuz (2023-06-01) In this paper, we deal with codes obtained from Butson-Hadamard matrices, called BH codes, focusing on their minimum distances. We first consider the usual Hamming distance and find lower bounds for distances of BH codes. ...
Verifiable Timed Accountable Subgroup Multi-signatures ÖZDEN, DUYGU; Yayla, Oğuz (2023-01-01) Accountable subgroup multi-signature (ASM) is a form of multi-signature scheme that permits any subgroup of a group to sign a message on behalf of the group while ensuring that the signers are accountable for the multi-sig...
Codes on subgroups of weighted projective tori ŞAHİN, MESUT; Yayla, Oğuz (2023-01-01) We obtain certain algebraic invariants relevant in studying codes on subgroups of weighted projective tori inside an n-dimensional weighted projective space. As application, we compute all the main parameters of generalize...
Random Sequences in Vehicle Routing Problem Gülşen, Mehmet Emin; Yayla, Oğuz (2023-01-01) In this paper, we study the Capacitated Vehicle Routing Problem (CVRP) and implemented a simulation-based algorithm with different random number generators. The Binary-CWS-MCS algorithm has been integrated with six differe...

Citation Formats