default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGohar M. Kyureghyan
Person information
- affiliation: Otto von Guericke University of Magdeburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j29]Björn Kriepke, Gohar M. Kyureghyan, Matthias Schymura:
On the size of integer programs with bounded non-vanishing subdeterminants. J. Comb. Theory, Ser. A 212: 106003 (2025)- 2024
- [j28]Anna-Maurin Graner
, Gohar M. Kyureghyan:
Constructing irreducible polynomials recursively with a reverse composition method. Des. Codes Cryptogr. 92(3): 695-708 (2024) - [c7]Björn Kriepke, Gohar M. Kyureghyan:
Algebraic Structure of the Iterates of χ. CRYPTO (4) 2024: 412-424 - [i9]Anna-Maurin Graner, Björn Kriepke, Lucas Krompholz, Gohar M. Kyureghyan:
On the bijectivity of the map χ. IACR Cryptol. ePrint Arch. 2024: 187 (2024) - [i8]Björn Kriepke, Gohar M. Kyureghyan:
Algebraic Structure of the Iterates of χ. IACR Cryptol. ePrint Arch. 2024: 801 (2024) - 2023
- [j27]Lukas Kölsch, Björn Kriepke, Gohar M. Kyureghyan:
Image sets of perfectly nonlinear maps. Des. Codes Cryptogr. 91(1): 1-27 (2023) - 2022
- [j26]Gohar M. Kyureghyan, Melsik K. Kyuregyan:
A recurrent construction of irreducible polynomials of fixed degree over finite fields. Appl. Algebra Eng. Commun. Comput. 33(2): 163-171 (2022) - 2021
- [j25]Gohar M. Kyureghyan, Shuxing Li, Alexander Pott:
On the Intersection Distribution of Degree Three Polynomials and Related Topics. Electron. J. Comb. 28(2): 2 (2021) - [i7]Lukas Kölsch, Björn Kriepke, Gohar M. Kyureghyan:
Image sets of perfectly nonlinear maps. IACR Cryptol. ePrint Arch. 2021: 98 (2021) - 2020
- [j24]Anne Canteaut, Gohar M. Kyureghyan, Alexander Pott, Felix Ulmer:
Editorial: Coding and Cryptography 2019. Des. Codes Cryptogr. 88(9): 1699 (2020) - [j23]Daniel Gerike, Gohar M. Kyureghyan:
Permutations on finite fields with invariant cycle structure on lines. Des. Codes Cryptogr. 88(9): 1723-1740 (2020) - [c6]Faruk Göloglu, Lukas Kölsch, Gohar M. Kyureghyan, Léo Perrin:
On Subspaces of Kloosterman Zeros and Permutations of the Form L1(x-1)+L2(x). WAIFI 2020: 207-221 - [i6]Gohar M. Kyureghyan, Shuxing Li, Alexander Pott:
On the intersection distribution of degree three polynomials and related topics. CoRR abs/2003.10040 (2020) - [i5]Faruk Göloglu, Lukas Kölsch, Gohar M. Kyureghyan, Léo Perrin:
On subspaces of Kloosterman zeros and permutations of the form L1(x-1)+L2(x). CoRR abs/2003.14068 (2020) - [i4]Lukas Kölsch, Björn Kriepke, Gohar M. Kyureghyan:
Image sets of perfectly nonlinear maps. CoRR abs/2012.00870 (2020)
2010 – 2019
- 2017
- [j22]Pascale Charpin, Thomas Johansson, Gohar M. Kyureghyan, Nicolas Sendrier, Jean-Pierre Tillich:
Editorial: Special issue on coding and cryptography. Des. Codes Cryptogr. 82(1-2): 1-2 (2017) - [j21]Pascale Charpin, Gohar M. Kyureghyan:
On sets determining the differential spectrum of mappings. Int. J. Inf. Coding Theory 4(2/3): 170-184 (2017) - 2014
- [j20]Gohar M. Kyureghyan, Valentin Suder:
On inversion in ℤ2n-1. Finite Fields Their Appl. 25: 234-254 (2014) - [j19]Pascale Charpin, Gohar M. Kyureghyan, Valentin Suder:
Sparse permutations with low differential uniformity. Finite Fields Their Appl. 28: 214-243 (2014) - 2013
- [j18]Gohar M. Kyureghyan, Peter Müller, Qi Wang:
On the Size of Kakeya Sets in Finite Vector Spaces. Electron. J. Comb. 20(3): 36 (2013) - [j17]Daniel Augot, Anne Canteaut, Gohar M. Kyureghyan, Faina I. Solov'eva, Øyvind Ytrehus:
Editorial. Des. Codes Cryptogr. 66(1-3): 1-2 (2013) - [p2]Gohar M. Kyureghyan:
Special Mappings of Finite Fields. Finite Fields and Their Applications 2013: 117-144 - [i3]Gohar M. Kyureghyan, Valentin Suder:
On Inversion in Z_{2^n-1}. CoRR abs/1303.0716 (2013) - [i2]Pascale Charpin, Gohar M. Kyureghyan:
A note on verifying the APN property. IACR Cryptol. ePrint Arch. 2013: 475 (2013) - 2012
- [j16]Gohar M. Kyureghyan, Ferruh Özbudak:
Planarity of products of two linearized polynomials. Finite Fields Their Appl. 18(6): 1076-1088 (2012) - [c5]Gohar M. Kyureghyan, Valentin Suder:
On inverses of APN exponents. ISIT 2012: 1207-1211 - 2011
- [j15]Melsik K. Kyuregyan, Gohar M. Kyureghyan:
Irreducible compositions of polynomials over finite fields. Des. Codes Cryptogr. 61(3): 301-314 (2011) - [j14]Gohar M. Kyureghyan:
Constructing permutations of finite fields via linear translators. J. Comb. Theory A 118(3): 1052-1061 (2011)
2000 – 2009
- 2009
- [j13]Zhengbang Zha, Gohar M. Kyureghyan, Xueli Wang:
Perfect nonlinear binomials and their semifields. Finite Fields Their Appl. 15(2): 125-133 (2009) - [j12]Pascale Charpin, Gohar M. Kyureghyan:
When does G(x)+gammaTr(H(x)) permute Fpn? Finite Fields Their Appl. 15(5): 615-632 (2009) - [p1]Gohar M. Kyureghyan, Yin Tan:
On a Family of Planar Mappings. Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes 2009: 175-178 - 2008
- [j11]Gohar M. Kyureghyan:
Minimal polynomials of the modified de Bruijn sequences. Discret. Appl. Math. 156(9): 1549-1553 (2008) - [j10]Jürgen Bierbrauer, Gohar M. Kyureghyan:
Crooked binomials. Des. Codes Cryptogr. 46(3): 269-301 (2008) - [j9]Christian Bey, Gohar M. Kyureghyan:
On Boolean functions with the sum of every two of them being bent. Des. Codes Cryptogr. 49(1-3): 341-346 (2008) - [j8]Anne Canteaut, Pascale Charpin, Gohar M. Kyureghyan:
A new class of monomial bent functions. Finite Fields Their Appl. 14(1): 221-241 (2008) - [j7]Pascale Charpin, Gohar M. Kyureghyan:
Cubic Monomial Bent Functions: A Subclass of M. SIAM J. Discret. Math. 22(2): 650-665 (2008) - [c4]Pascale Charpin, Gohar M. Kyureghyan:
On a Class of Permutation Polynomials over F2m. SETA 2008: 368-376 - [c3]Gohar M. Kyureghyan, Alexander Pott:
Some Theorems on Planar Mappings. WAIFI 2008: 117-122 - [i1]Zhengbang Zha, Gohar M. Kyureghyan, Xueli Wang:
A New Family of Perfect Nonlinear Binomials. IACR Cryptol. ePrint Arch. 2008: 196 (2008) - 2007
- [j6]Gohar M. Kyureghyan:
The only crooked power functions are x2k+2l. Eur. J. Comb. 28(4): 1345-1350 (2007) - [j5]Gohar M. Kyureghyan:
Crooked maps in F22. Finite Fields Their Appl. 13(3): 713-726 (2007) - 2006
- [j4]Yves Edel, Gohar M. Kyureghyan, Alexander Pott:
A new APN function which is not equivalent to a power mapping. IEEE Trans. Inf. Theory 52(2): 744-747 (2006) - [c2]Anne Canteaut, Pascale Charpin, Gohar M. Kyureghyan:
A new class of monomial bent functions. ISIT 2006: 903-906 - 2005
- [j3]Gohar M. Kyureghyan:
Minimal Polynomials of the Modified de Bruijn Sequences. Electron. Notes Discret. Math. 21: 333-336 (2005) - 2004
- [c1]Yu-Chang Eun, Hong-Yeop Song, Gohar M. Kyureghyan:
One-Error Linear Complexity over Fp of Sidelnikov Sequences. SETA 2004: 154-165 - 2003
- [j2]Gohar M. Kyureghyan, Alexander Pott:
On the Linear Complexity of the Sidelnikov-Lempel-Cohn-Eastman Sequences. Des. Codes Cryptogr. 29(1-3): 149-164 (2003) - 2001
- [j1]Gohar M. Kyureghyan:
note: On a Degree Property of Cross-Intersecting Families. Comb. 21(3): 449-453 (2001)
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 2025-01-26 23:46 CET 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:
