default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgor A. Semaev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[i21]Igor A. Semaev:
New non-linearity parameters of Boolean functions. CoRR abs/1906.00426 (2019)- [i20]Igor A. Semaev:
New non-linearity parameters of Boolean functions. IACR Cryptol. ePrint Arch. 2019: 633 (2019) - 2018
- [j12]Stian Fauskanger, Igor A. Semaev:
Separable Statistics and Multidimensional Linear Cryptanalysis. IACR Trans. Symmetric Cryptol. 2018(2): 79-110 (2018) - 2017
- [j11]Peter Horák, Igor A. Semaev, Zsolt Tuza:
A combinatorial problem related to sparse systems of equations. Des. Codes Cryptogr. 85(1): 129-144 (2017) - [i19]Stian Fauskanger, Igor A. Semaev:
Separable Statistics and Multidimensional Linear Cryptanalysis. IACR Cryptol. ePrint Arch. 2017: 994 (2017) - 2016
- [j10]Igor A. Semaev:
MaxMinMax problem and sparse equations over finite fields. Des. Codes Cryptogr. 79(2): 383-404 (2016) - [i18]Igor A. Semaev:
On low degree polynomials in 2-round AES. IACR Cryptol. ePrint Arch. 2016: 141 (2016) - 2015
- [j9]Peter Horák, Igor A. Semaev, Zsolt Tuza:
An application of Combinatorics in Cryptography. Electron. Notes Discret. Math. 49: 31-35 (2015) - [c5]Stian Fauskanger, Igor A. Semaev:
Statistical and Algebraic Properties of DES. Inscrypt 2015: 93-107 - [i17]Igor A. Semaev:
New algorithm for the discrete logarithm problem on elliptic curves. CoRR abs/1504.01175 (2015) - [i16]Igor A. Semaev:
Experimental Study of DIGIPASS GO3 and the Security of Authentication. CoRR abs/1506.06332 (2015) - [i15]Igor A. Semaev:
New algorithm for the discrete logarithm problem on elliptic curves. IACR Cryptol. ePrint Arch. 2015: 310 (2015) - [i14]Igor A. Semaev:
Experimental Study of DIGIPASS GO3 and the Security of Authentication. IACR Cryptol. ePrint Arch. 2015: 609 (2015) - [i13]Stian Fauskanger, Igor A. Semaev:
Statistical and Algebraic Properties of DES. IACR Cryptol. ePrint Arch. 2015: 803 (2015) - 2014
- [i12]Igor A. Semaev:
MaxMinMax problem and sparse equations over finite fields. IACR Cryptol. ePrint Arch. 2014: 4 (2014) - [i11]Igor A. Semaev:
New Results in the Linear Cryptanalysis of DES. IACR Cryptol. ePrint Arch. 2014: 361 (2014) - 2013
- [j8]Igor A. Semaev:
Improved Agreeing-Gluing Algorithm. Math. Comput. Sci. 7(3): 321-339 (2013) - 2011
- [j7]Igor A. Semaev:
Sparse Boolean equations and circuit lattices. Des. Codes Cryptogr. 59(1-3): 349-364 (2011) - [i10]Igor A. Semaev, Mehdi M. Hassanzadeh:
New Statistical Box-Test and its Power. IACR Cryptol. ePrint Arch. 2011: 297 (2011) - [i9]Igor A. Semaev:
Local limit theorem for large deviations and statistical box-tests. IACR Cryptol. ePrint Arch. 2011: 298 (2011) - 2010
- [i8]Igor A. Semaev:
Improved Agreeing-Gluing Algorithm. IACR Cryptol. ePrint Arch. 2010: 140 (2010)
2000 – 2009
- 2009
- [j6]Igor A. Semaev:
Sparse Algebraic Equations over Finite Fields. SIAM J. Comput. 39(2): 388-409 (2009) - [i7]Igor A. Semaev:
Sparse Boolean equations and circuit lattices. IACR Cryptol. ePrint Arch. 2009: 252 (2009) - 2008
- [j5]Igor A. Semaev:
On solving sparse algebraic equations over finite fields. Des. Codes Cryptogr. 49(1-3): 47-60 (2008) - [j4]Håvard Raddum
, Igor A. Semaev:
Solving Multiple Right Hand Sides linear equations. Des. Codes Cryptogr. 49(1-3): 147-160 (2008) - [i6]Igor A. Semaev:
New hash function designs. IACR Cryptol. ePrint Arch. 2008: 455 (2008) - 2007
- [i5]Igor A. Semaev:
On solving sparse algebraic equations over finite fields II. IACR Cryptol. ePrint Arch. 2007: 280 (2007) - [i4]Håvard Raddum, Igor A. Semaev:
Solving MRHS linear equations. IACR Cryptol. ePrint Arch. 2007: 285 (2007) - 2006
- [c4]An Commeine, Igor A. Semaev:
An Algorithm to Solve the Discrete Logarithm Problem with the Number Field Sieve. Public Key Cryptography 2006: 174-190 - [i3]Håvard Raddum, Igor A. Semaev:
New Technique for Solving Sparse Equation Systems. IACR Cryptol. ePrint Arch. 2006: 475 (2006) - 2005
- [c3]An Braeken, Igor A. Semaev:
The ANF of the Composition of Addition and Multiplication mod 2n with a Boolean Function. FSE 2005: 112-125 - 2004
- [i2]Igor A. Semaev:
Summation polynomials and the discrete logarithm problem on elliptic curves. IACR Cryptol. ePrint Arch. 2004: 31 (2004) - 2003
- [i1]Igor A. Semaev:
A reduction of the space for the parallelized Pollard lambda search on elliptic curves over prime finite fields and on anomalous binary elliptic curves. IACR Cryptol. ePrint Arch. 2003: 166 (2003) - 2002
- [j3]Igor A. Semaev:
Special prime numbers and discrete logs in finite prime fields. Math. Comput. 71(237): 363-377 (2002) - 2001
- [c2]Igor A. Semaev:
A 3-Dimensional Lattice Reduction Algorithm. CaLC 2001: 181-193
1990 – 1999
- 1998
- [j2]Igor A. Semaev:
Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p. Math. Comput. 67(221): 353-356 (1998) - [j1]Igor A. Semaev:
An algorithm for evaluation of discrete logarithms in some nonprime finite fields. Math. Comput. 67(224): 1679-1689 (1998) - [c1]Igor A. Semaev:
Evaluation of Linear Relations between Vectors of a Lattice in Euclidean Space. ANTS 1998: 311-322
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-09 12:47 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:
