Faruk Göloglu

Orcid: 0000-0002-1223-3093

According to our database1, Faruk Göloglu authored at least 27 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Counting the number of non-isotopic Taniguchi semifields.
Des. Codes Cryptogr., March, 2024

2023
Classification of (q, q)-Biprojective APN Functions.
IEEE Trans. Inf. Theory, March, 2023

2022
Biprojective Almost Perfect Nonlinear Functions.
IEEE Trans. Inf. Theory, 2022

Classification of fractional projective permutations over finite fields.
Finite Fields Their Appl., 2022

2021
Equivalences of biprojective almost perfect nonlinear functions.
CoRR, 2021

On CCZ-inequivalence of some families of almost perfect nonlinear functions to permutations.
Cryptogr. Commun., 2021

2020
Almost perfect nonlinear families which are not equivalent to permutations.
Finite Fields Their Appl., 2020

On subspaces of Kloosterman zeros and permutations of the form L<sub>1</sub>(x<sup>-1</sup>)+L<sub>2</sub>(x).
CoRR, 2020

Inverse function is not component-wise uniform.
Cryptogr. Commun., 2020

On Subspaces of Kloosterman Zeros and Permutations of the Form L<sub>1(x<sup>-1</sup>)+L<sub>2(x)</sub></sub>.
Proceedings of the Arithmetic of Finite Fields - 8th International Workshop, 2020

2019
A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms.
Math. Comput., 2019

Proofs of several conjectures on linear codes from Boolean functions.
Discret. Math., 2019

2016
On the division property of S-boxes.
IACR Cryptol. ePrint Arch., 2016

Fibre products of supersingular curves and the enumeration of irreducible polynomials with prescribed coefficients.
Finite Fields Their Appl., 2016

2015
Almost perfect nonlinear trinomials and hexanomials.
Finite Fields Their Appl., 2015

New bounds for permutation codes in Ulam metric.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
On theorems of Carlitz and Payne on permutation polynomials over finite fields with an application to x<sup>-1</sup>+L(x).
Finite Fields Their Appl., 2014

A non-cyclic triple-error-correcting BCH-like code and some minimum distance results.
Des. Codes Cryptogr., 2014

2013
Solving a 6120-bit DLP on a Desktop Computer.
IACR Cryptol. ePrint Arch., 2013

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in F<sub>2<sup>1971</sup></sub>.
IACR Cryptol. ePrint Arch., 2013

On the Function Field Sieve and the Impact of Higher Splitting Probabilities - Application to Discrete Logarithms in and.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Binary Kloosterman Sums Modulo 256 and Coefficients of the Characteristic Polynomial.
IEEE Trans. Inf. Theory, 2012

A Note on "Differential Properties of x -> x<sup>2<sup>t</sup>-1</sup>".
IEEE Trans. Inf. Theory, 2012

Ternary Kloosterman sums modulo 4.
Finite Fields Their Appl., 2012

2010
Ternary Kloosterman Sums Modulo 18 Using Stickelberger's Theorem.
Proceedings of the Sequences and Their Applications - SETA 2010, 2010

2008
Results on the Crosscorrelation and Autocorrelation of Sequences.
Proceedings of the Sequences and Their Applications, 2008

2006
On Lempel-Ziv Complexity of Sequences.
Proceedings of the Sequences and Their Applications, 2006


  Loading...