Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Bahattin Yildiz"'
Autor:
Bertrand Cambou, Michael Gowanlock, Bahattin Yildiz, Dina Ghanaimiandoab, Kaitlyn Lee, Stefan Nelson, Christopher Philabaum, Alyssa Stenberg, Jordan Wright
Publikováno v:
Applied Sciences, Vol 11, Iss 6, p 2801 (2021)
Lattice and code cryptography can replace existing schemes such as elliptic curve cryptography because of their resistance to quantum computers. In support of public key infrastructures, the distribution, validation and storage of the cryptographic k
Externí odkaz:
https://doaj.org/article/3ccf89da691842e48039d10bc82893db
Autor:
Sudipta Mallik, Bahattin Yildiz
Publikováno v:
Algebra and Discrete Mathematics. 32:49-64
Binary linear codes are constructed from graphs, in particular, by the generator matrix [In|A] where A is the adjacency matrix of a graph on n vertices. A combinatorial interpretation of the minimum distance of such codes is given. We also present gr
Autor:
Weston Loucks, Bahattin Yildiz
Publikováno v:
Involve 13, no. 2 (2020), 257-279
A new secret-sharing scheme is constructed using elementary tools from different fields of mathematics. A method is introduced which uses the assignment of points on a hyperplane, serving as terminal points of vectors which meet an outlined criterion
Publikováno v:
Advances in Mathematics of Communications. 14:11-22
In this work, we study construction methods for self-dual and formally self-dual codes from group rings, arising from the cyclic group, the dihedral group, the dicyclic group and the semi-dihedral group. Using these constructions over the rings \begi
Publikováno v:
Dipòsit Digital de Documents de la UAB
Universitat Autònoma de Barcelona
Universitat Autònoma de Barcelona
We study \begin{document}$ G $\end{document} -codes over the ring \begin{document}$ {\mathbb{Z}}_4 $\end{document} , which are codes that are held invariant by the action of an arbitrary group \begin{document}$ G $\end{document} . We view these codes
Autor:
Abidin Kaya, Bahattin Yildiz
Publikováno v:
Discrete Applied Mathematics. 271:74-83
In this work, we introduce new construction methods for self-dual codes using a Baumert–Hall array. We apply the constructions over the alphabets F 2 and F 4 + u F 4 and combine them with extension theorems and neighboring constructions. As a resul
Autor:
Bahattin Yildiz, Alexander Tylyshchak, Joe Gildea, Abidin Kaya, Adrian Korban, Steven T. Dougherty
Publikováno v:
Finite Fields and Their Applications. 57:108-127
We introduce a bordered construction over group rings for self-dual codes. We apply the constructions over the binary field and the ring F 2 + u F 2 , using groups of orders 9, 15, 21, 25, 27, 33 and 35 to find extremal binary self-dual codes of leng
Autor:
Dina Ghanaimiandoab, Kaitlyn Lee, Bertrand Cambou, Jordan Wright, Christopher Philabaum, Michael Gowanlock, Alyssa Stenberg, Bahattin Yildiz, Stefan Nelson
Publikováno v:
Applied Sciences
Volume 11
Issue 6
Applied Sciences, Vol 11, Iss 2801, p 2801 (2021)
Volume 11
Issue 6
Applied Sciences, Vol 11, Iss 2801, p 2801 (2021)
Lattice and code cryptography can replace existing schemes such as elliptic curve cryptography because of their resistance to quantum computers. In support of public key infrastructures, the distribution, validation and storage of the cryptographic k
Autor:
Bertrand Cambou, Stenberg A, Bahattin Yildiz, Jordan Wright, Michael Gowanlock, Lee K, Christopher Philabaum, Nelson S, Ghanaimiandoab D
Lattice and code cryptography can replace existing schemes such as Elliptic Curve Cryptography because of their resistance to quantum computers. In support of public key infrastructures, the distribution, validation and storage of the cryptographic k
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6afa245549a7a8ac78d397797eb93dd1
Publikováno v:
ACCT
The quasi-cyclic moderate-density parity-check code (QC-MDPC) cryptosystem is one of the recent variants of the original McEliece code-based cryptosystem, that has also been part of the BIKE cryptosystem, which has been submitted to NIST as a post-Qu