default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuri L. Borissov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i10]Miroslav Markov, Yuri L. Borissov:
Computing the Weight Distribution of the Binary Reed-Muller Code R(4, 9). CoRR abs/2309.10462 (2023)- 2021
- [i9]Yuri L. Borissov, Miroslav Markov:
An O(log2 p) Approach to Point-Counting on Elliptic Curves From a Prominent Family Over the Prime Field 픽p. IACR Cryptol. ePrint Arch. 2021: 332 (2021) - 2020
- [j12]Yuri L. Borissov
, Lyubomir Borissov:
A note on the distinctness of some Kloosterman sums. Cryptogr. Commun. 12(5): 1051-1056 (2020) - [c8]Miroslav Markov, Yuri L. Borissov:
Point-Counting on Elliptic Curves Belonging to One Prominent Family: Revisited. ACCT 2020: 106-109
2010 – 2019
- 2019
- [j11]Assen Bojilov, Lyubomir Borissov, Yuri L. Borissov:
Computing the number of finite field elements with prescribed absolute trace and co-trace. Cryptogr. Commun. 11(3): 497-507 (2019) - [c7]Yuri L. Borissov, Miroslav Markov:
An Approach for Computing the Number of Points on Elliptic Curve y2 = x3 + a (mod p) via Explicit Formula for That Number Modulo p. IWSDA 2019: 1-5 - 2017
- [j10]Robert Tsenkov, Yuri L. Borissov:
Two-Round Iterative Characteristics for Linear Cryptanalysis of Modified DES with Embedded Parity Checks. Electron. Notes Discret. Math. 57: 205-210 (2017) - [i8]Yuri L. Borissov, Peter G. Boyvalenkov, Robert Tsenkov:
On a Linear Cryptanalysis of a Family of Modified DES Ciphers with Even Weight S-boxes. IACR Cryptol. ePrint Arch. 2017: 89 (2017) - 2016
- [j9]Yuri L. Borissov:
Some new results on Hadamard modulo prime matrices. Probl. Inf. Transm. 52(2): 134-141 (2016) - 2015
- [c6]Yuri L. Borissov, Peter G. Boyvalenkov, Robert Tsenkov:
Linear Cryptanalysis and Modified DES with Embedded Parity Check in the S-boxes. BalkanCryptSec 2015: 60-78 - 2012
- [c5]Yuri L. Borissov, Moon Ho Lee:
Revisiting butson hadamard matrix construction based on a prominent class of pseudo-random sequences. CUBE 2012: 11-16 - 2011
- [i7]Yuri L. Borissov:
On a Connection between Ideal Two-level Autocorrelation and Almost Balancedness of $p$-ary Sequences. CoRR abs/1103.3580 (2011) - 2010
- [j8]Thomas W. Cusick, Yuri L. Borissov:
A refinement of Cusick-Cheon bound for the second order binary Reed-Muller code. Discret. Math. 310(24): 3537-3543 (2010)
2000 – 2009
- 2009
- [j7]Yuri L. Borissov:
On the Cusick-Cheon Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed-Muller Code. IEEE Trans. Inf. Theory 55(1): 16-18 (2009) - [c4]Moon Ho Lee, Yuri L. Borissov:
On Jacket transforms over finite fields. ISIT 2009: 2803-2807 - [p1]Yuri L. Borissov, Nikolai L. Manev:
Some Comments on Bossert-Mahr-Heilig Scheme. Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes 2009: 244-249 - 2008
- [j6]Moon Ho Lee, Yuri L. Borissov:
Fast Decoding of the p-Ary First-Order Reed-Muller Codes Based On Jacket Transform. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(3): 901-904 (2008) - [i6]Yuri L. Borissov:
On Cusick-Cheon's Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed-Muller Code. CoRR abs/0802.3437 (2008) - 2007
- [j5]Yuri L. Borissov, Moon Ho Lee:
Bounds on Key Appearance Equivocation for Substitution Ciphers. IEEE Trans. Inf. Theory 53(6): 2294-2296 (2007) - [i5]Yuri L. Borissov, Moon Ho Lee, Svetla Nikova:
On Asymptotic Behavior of the Ratio Between the Numbers of Binary Primitive and Irreducible Polynomials. IACR Cryptol. ePrint Arch. 2007: 301 (2007) - 2006
- [j4]An Braeken, Yuri L. Borissov, Svetla Nikova, Bart Preneel:
Classification of cubic (n-4)-resilient Boolean functions. IEEE Trans. Inf. Theory 52(4): 1670-1676 (2006) - [i4]Yuri L. Borissov, Moon Ho Lee:
Bounds on Key Appearance Equivocation for Substitution Ciphers. CoRR abs/cs/0612064 (2006) - 2005
- [j3]Yuri L. Borissov, An Braeken, Svetla Nikova, Bart Preneel:
On the covering radii of binary Reed-Muller codes in the set of resilient Boolean functions. IEEE Trans. Inf. Theory 51(3): 1182-1189 (2005) - [c3]An Braeken, Yuri L. Borissov, Svetla Nikova, Bart Preneel:
Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties. ICALP 2005: 324-334 - [i3]An Braeken, Yuri L. Borissov, Svetla Nikova, Bart Preneel:
Classification of Cubic (n-4)-resilient Boolean Functions. IACR Cryptol. ePrint Arch. 2005: 332 (2005) - 2004
- [i2]Yuri L. Borissov, An Braeken, Svetla Nikova:
Covering Radius of the (n-3)-rd Order Reed-Muller Code in the Set of Resilient Functions. IACR Cryptol. ePrint Arch. 2004: 202 (2004) - [i1]An Braeken, Yuri L. Borissov, Svetla Nikova, Bart Preneel:
Classification of Boolean Functions of 6 Variables or Less with Respect to Cryptographic Properties. IACR Cryptol. ePrint Arch. 2004: 248 (2004) - 2003
- [j2]Yuri L. Borissov, Nikolai L. Manev, Svetla Nikova:
On the Non-minimal Codewords in Binary Reed-Muller Codes. Discret. Appl. Math. 128(1): 65-74 (2003) - [c2]Yuri L. Borissov, An Braeken, Svetla Nikova, Bart Preneel:
On the Covering Radius of Second Order Binary Reed-Muller Code in the Set of Resilient Boolean Functions. IMACC 2003: 82-92 - 2002
- [c1]Yuri L. Borissov, Svetla Nikova, Bart Preneel, Joos Vandewalle:
On a Resynchronization Weakness in a Class of Combiners with Memory. SCN 2002: 164-173 - 2001
- [j1]Yuri L. Borissov, Nikolai L. Manev, Svetla Nikova:
On the Non-Minimal codewords of weight 2dmin in the binary Reed-Muller Code. Electron. Notes Discret. Math. 6: 548-555 (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 2024-04-25 05:50 CEST 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:
