default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOguz Yayla
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Mesut Sahin
, Oguz Yayla:
Codes on subgroups of weighted projective tori. Des. Codes Cryptogr. 92(5): 1201-1218 (2024)- [i25]Sibel Kurt Toplu, Talha Arikan, Pinar AydogDu, Oguz Yayla:
On a Group Under Which Symmetric Reed-Muller Codes are Invariant. CoRR abs/2401.11496 (2024) - [i24]Ahmet Ramazan Agirtas, Oguz Yayla:
A Lattice-based Accountable Subgroup Multi-signature Scheme with Verifiable Group Setup. IACR Cryptol. ePrint Arch. 2024: 14 (2024) - [i23]Melike Çakmak, Ahmet Sinak, Oguz Yayla:
New self-orthogonal codes from weakly regular plateaued functions and their application in LCD codes. IACR Cryptol. ePrint Arch. 2024: 125 (2024) - [i22]Ahmet Ramazan Agirtas, Neslihan Yaman Gökce, Oguz Yayla:
Enhancing Local Verification: Aggregate and Multi-Signature Schemes. IACR Cryptol. ePrint Arch. 2024: 1055 (2024) - [i21]Ahmet Ramazan Agirtas, Arda Bugra Özer, Zülfükar Saygi, Oguz Yayla:
Distributed Verifiable Random Function With Compact Proof. IACR Cryptol. ePrint Arch. 2024: 1130 (2024) - [i20]Erkan Uslu, Oguz Yayla:
Dilithium-Based Verifiable Timed Signature Scheme. IACR Cryptol. ePrint Arch. 2024: 1262 (2024) - [i19]Oguz Yayla, Yunus Emre Yilmaz:
Design and Implementation of a Fast, Platform-Adaptive, AIS-20/31 Compliant PLL-Based True Random Number Generator on a Zynq 7020 SoC FPGA. IACR Cryptol. ePrint Arch. 2024: 1442 (2024) - [i18]Oguz Yayla, Yunus Emre Yilmaz:
32-bit and 64-bit CDC-7-XPUF Implementation on a Zynq-7020 SoC. IACR Cryptol. ePrint Arch. 2024: 1443 (2024) - [i17]Oguz Yayla, Yunus Emre Yilmaz:
A Combined Design of 4-PLL-TRNG and 64-bit CDC-7-XPUF on a Zynq-7020 SoC. IACR Cryptol. ePrint Arch. 2024: 1457 (2024) - 2023
- [j11]Büsra Özden, Oguz Yayla:
Partial direct product difference sets and almost quaternary sequences. Adv. Math. Commun. 17(3): 572-588 (2023) - [c9]Hatice Kübra Güner, Ceyda Mangir, Oguz Yayla:
Improving Performance in Space-Hard Algorithms. CSCML 2023: 398-410 - [c8]Duygu Ozden, Oguz Yayla:
Verifiable Timed Accountable Subgroup Multi-signatures. ICISS 2023: 295-305 - [i16]Ahmet Ramazan Agirtas, Oguz Yayla:
Compartment-based and Hierarchical Threshold Delegated Verifiable Accountable Subgroup Multi-signatures. IACR Cryptol. ePrint Arch. 2023: 548 (2023) - [i15]Esra Günsay, Burcu E. Karakas, N. Gamze Orhon Kiliç, Oguz Yayla:
Design of Blockchain-Based Many-to-Many Anonymous Data Sharing Scheme. IACR Cryptol. ePrint Arch. 2023: 975 (2023) - [i14]Hatice Kübra Güner, Ceyda Mangir, Oguz Yayla:
White-Box Block Cipher Implementation Based on LS-Design. IACR Cryptol. ePrint Arch. 2023: 1096 (2023) - [i13]Duygu Ozden, Oguz Yayla:
Verifiable Timed Proxy Signatures and Multi-signatures. IACR Cryptol. ePrint Arch. 2023: 1107 (2023) - [i12]Sila Özeren, Oguz Yayla:
Methods for Masking CRYSTALS-Kyber Against Side-Channel Attacks. IACR Cryptol. ePrint Arch. 2023: 1340 (2023) - 2022
- [j10]Yagmur Çakiroglu, Oguz Yayla:
A new lower bound on the family complexity of Legendre sequences. Appl. Algebra Eng. Commun. Comput. 33(2): 173-192 (2022) - [j9]Yagmur Çakiroglu, Oguz Yayla, Emrah Sercan Yilmaz:
The number of irreducible polynomials over finite fields with vanishing trace and reciprocal trace. Des. Codes Cryptogr. 90(10): 2407-2417 (2022) - [c7]Mehmet Emin Gülen, Oguz Yayla:
Random Sequences in Vehicle Routing Problem. NMA 2022: 159-170 - [i11]Mesut Sahin, Oguz Yayla:
Codes on Subgroups of Weighted Projective Tori. CoRR abs/2210.07550 (2022) - [i10]Ahmet Ramazan Agirtas, Oguz Yayla:
Pairing-based Accountable Subgroup Multi-signatures with Verifiable Group Setup. IACR Cryptol. ePrint Arch. 2022: 18 (2022) - [i9]Chenar Abdulla Hassan, Oguz Yayla:
Radix-3 NTT-Based Polynomial Multiplication for Lattice-Based Cryptography. IACR Cryptol. ePrint Arch. 2022: 726 (2022) - [i8]Esra Günsay, Oguz Yayla:
Decentralized Anonymous IoT Data Sharing with Key-Private Proxy Re-Encryption. IACR Cryptol. ePrint Arch. 2022: 1426 (2022) - 2021
- [c6]Murat Burhan Ilter, Nese Koçak, Erkan Uslu, Oguz Yayla, Nergiz Yuca:
On the Number of Arithmetic Operations in NTT-based Polynomial Multiplication in Kyber and Dilithium Cryptosystems. SIN 2021: 1-7 - [i7]Gizem Kara, Oguz Yayla:
Gröbner Basis Attack on STARK-Friendly Symmetric-Key Primitives: JARVIS, MiMC and GMiMCerf. IACR Cryptol. ePrint Arch. 2021: 1232 (2021) - 2020
- [j8]Büsra Özden, Oguz Yayla:
Almost p-ary sequences. Cryptogr. Commun. 12(6): 1057-1069 (2020) - [i6]Damla Acar, Oguz Yayla:
Power Hadamard matrices and Plotkin-optimal pk-ary codes. CoRR abs/2004.00771 (2020) - [i5]Oguz Yayla:
Families of sequences with good family complexity and cross-correlation measure. CoRR abs/2004.13938 (2020) - [i4]Yagmur Çakiroglu, Oguz Yayla, Emrah Sercan Yilmaz:
The number of irreducible polynomials over finite fields with vanishing trace and reciprocal trace. CoRR abs/2005.09402 (2020) - [i3]Büsra Özden, Oguz Yayla:
Partial direct product difference sets and sequences with ideal autocorrelation. CoRR abs/2005.12497 (2020)
2010 – 2019
- 2018
- [j7]Arne Winterhof, Oguz Yayla, Volker Ziegler:
Non-existence of Some Nearly Perfect Sequences, Near Butson-Hadamard Matrices, and Near Conference Matrices. Math. Comput. Sci. 12(4): 465-471 (2018) - [i2]Yagmur Çakiroglu, Oguz Yayla:
A better lower bound on the family complexity of binary Legendre sequence. CoRR abs/1812.06140 (2018) - 2017
- [c5]Sibel Kurt, Oguz Yayla:
Near Butson-Hadamard Matrices and Nonlinear Boolean Functions. NuTMiC 2017: 254-266 - 2016
- [j6]Ferruh Özbudak, Burcu Gülmez Temür, Oguz Yayla:
Further results on fibre products of Kummer covers and curves with many points over finite fields. Adv. Math. Commun. 10(1): 151-162 (2016) - [j5]Oguz Yayla:
Nearly perfect sequences with arbitrary out-of-phase autocorrelation. Adv. Math. Commun. 10(2): 401-411 (2016) - 2015
- [j4]Ferruh Özbudak, Seher Tutdere, Oguz Yayla:
On some bounds on the minimum distance of cyclic codes over finite fields. Des. Codes Cryptogr. 76(2): 173-178 (2015) - [j3]László Mérai, Oguz Yayla:
Improving results on the pseudorandomness of sequences generated via the additive order of a finite field. Discret. Math. 338(11): 2020-2025 (2015) - [j2]Bilal Alam, Ferruh Özbudak, Oguz Yayla:
Classes of weak Dembowski-Ostrom polynomials for multivariate quadratic cryptosystems. J. Math. Cryptol. 9(1): 11-22 (2015) - 2014
- [j1]Ferruh Özbudak, Oguz Yayla:
Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes. Theor. Comput. Sci. 520: 111-123 (2014) - [c4]Oguz Yayla:
Families of Pseudorandom Binary Sequences with Low Cross-Correlation Measure. BalkanCryptSec 2014: 31-39 - [c3]Ferruh Özbudak, Burcu Gülmez Temür, Oguz Yayla:
On Fibre Products of Kummer Curves with Many Rational Points over Finite Fields. ICMCTA 2014: 307-315 - [c2]Ferruh Özbudak, Ahmet Sinak, Oguz Yayla:
On Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functions. WAIFI 2014: 137-154 - [i1]Oguz Yayla:
Non-existence of nearly perfect sequences with arbitrary out-of-phase autocorrelation. CoRR abs/1408.6883 (2014) - 2012
- [c1]Ferruh Özbudak, Oguz Yayla, C. Cengiz Yildirim:
Nonexistence of Certain Almost p-ary Perfect Sequences. SETA 2012: 13-24
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 01:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
