Sonlu cisimler üzerindeki x^k-cx-d polinomlarının iki uygulaması üzerine ve daha fazlası

Date

2023-1-11

Author

İrimağzı, Canberk
Özbudak, Ferruh

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

649
views

0
downloads

For integers k∈[2,q−2] coprime to q−1 , we first bound the number of zeroes of the family of polynomials xk−cx−d∈Fq[x] where q=2n such that q−1 is a prime or q=3n such that (q−1)/2 is a prime. This gives us bounds on cross-correlation of a subfamily of Golomb Costas arrays. Next, we show that the zero set of xk−cx−d over Fq is a planar almost difference set in F∗q and hence for some set of pairs (c, d), they produce optical orthogonal codes with λ=1 . More generally, we give an algorithm to produce optical orthogonal codes (OOCs) from P(x)=xℓ1+cℓ2xℓ2+cℓ2−1xℓ2−1+⋯+c1x∈Fq[x] where interestingly ℓ1≫ℓ2 . We focus on the case ℓ2∈{2,3} and provide examples of (q−1,w,λ) -OOCs with λ∈{2,3} .

Subject Keywords

Finite Fields, Golomb Costas Permutations, Almost Difference Families, Optical Orthogonal Codes, Radar, Sonar, Optical CDMA

URI

https://doi.org/10.1007/978-3-031-22944-2_2
https://books.google.com.tr/books?hl=en&lr=&id=wd2mEAAAQBAJ&oi=fnd&pg=PA14&ots=mTv1cDMzpU&sig=EzqwShbQ0bXSFOtNjB8nT7mBIY0&redir_esc=y#v=onepage&q&f=false

Relation

Sonlu Cisimlerin Aritmetiği

Collections

Department of Mathematics, Book / Book chapter

Suggestions

OpenMETU
Core

Results on complexity of multiplication over finite fields Cenk, Murat; Özbudak, Ferruh; Department of Cryptography (2009) Let n and l be positive integers and f (x) be an irreducible polynomial over Fq such that ldeg( f (x)) < 2n - 1, where q is 2 or 3. We obtain an effective upper bound for the multiplication complexity of n-term polynomials modulo f (x)^l. This upper bound allows a better selection of the moduli when Chinese Remainder Theorem is used for polynomial multiplication over Fq. We give improved formulae to multiply polynomials of small degree over Fq. In particular we improve the best known multiplication complexi...
Large sparse matrix-vector multiplication over finite fields Mangır, Ceyda; Cenk, Murat; Manguoğlu, Murat; Department of Cryptography (2019) Cryptographic computations such as factoring integers and computing discrete logarithms require solving a large sparse system of linear equations over finite fields. When dealing with such systems iterative solvers such as Wiedemann or Lanczos algorithms are used. The computational cost of both methods is often dominated by successive matrix-vector products. In this thesis, we introduce a new algorithm for computing a large sparse matrix-vector multiplication over finite fields. The proposed algorithm is im...
On two applications of polynomials x^k-cx-d over finite fields and more İrimağzı, Canberk; Özbudak, Ferruh (Springer, Cham, 2023-01-01) For integers k∈[2,q−2] coprime to q−1 , we first bound the number of zeroes of the family of polynomials xk−cx−d∈Fq[x] where q=2n such that q−1 is a prime or q=3n such that (q−1)/2 is a prime. This gives us bounds on cross-correlation of a subfamily of Golomb Costas arrays. Next, we show that the zero set of xk−cx−d over Fq is a planar almost difference set in F∗q and hence for some set of pairs (c, d), they produce optical orthogonal codes with λ=1 . More generally, we give an algorithm to produ...
On the index of fixed point subgroup Türkan, Erkan Murat; Ercan, Gülin; Department of Mathematics (2011) Let G be a finite group and A be a subgroup of Aut(G). In this work, we studied the influence of the index of fixed point subgroup of A in G on the structure of G. When A is cyclic, we proved the following: (1) [G,A] is solvable if this index is squarefree and the orders of G and A are coprime. (2) G is solvable if the index of the centralizer of each x in H-G is squarefree where H denotes the semidirect product of G by A. Moreover, for an arbitrary subgroup A of Aut(G) whose order is coprime to the order o...
Character sums of quadratic forms over finite fields and the number of rational points for some classes of artin-schreier type curves Coşgun, Ayhan; Doğanaksoy, Ali; Department of Mathematics (2017) Exponential sums of quadratic forms over finite fields have many applications to various areas such as coding theory and cryptography. As an example to these applications, there is an organic connection between exponential sums of quadratic forms and the number of rational points of algebraic curves defined over finite fields. This connection is central in the application of algebraic geometry to coding theory and cryptography. In this thesis, different facts and techniques of theory of finite fields are co...

Citation Formats

C. İrimağzı and F. Özbudak, Sonlu cisimler üzerindeki x^k-cx-d polinomlarının iki uygulaması üzerine ve daha fazlası. 2023, p. 32.