Yuri L. Borissov

Orcid: 0000-0002-7036-5529

According to our database1, Yuri L. Borissov authored at least 29 papers between 2001 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Computing the Weight Distribution of the Binary Reed-Muller Code R(4, 9).
CoRR, 2023

2021
An O(log<sup>2</sup> p) Approach to Point-Counting on Elliptic Curves From a Prominent Family Over the Prime Field 픽<sub>p</sub>.
IACR Cryptol. ePrint Arch., 2021

2020
A note on the distinctness of some Kloosterman sums.
Cryptogr. Commun., 2020

Point-Counting on Elliptic Curves Belonging to One Prominent Family: Revisited.
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2019
Computing the number of finite field elements with prescribed absolute trace and co-trace.
Cryptogr. Commun., 2019

An Approach for Computing the Number of Points on Elliptic Curve y<sup>2</sup> = x<sup>3</sup> + a (mod p) via Explicit Formula for That Number Modulo p.
Proceedings of the Ninth International Workshop on Signal Design and its Applications in Communications, 2019

2017
On a Linear Cryptanalysis of a Family of Modified DES Ciphers with Even Weight S-boxes.
IACR Cryptol. ePrint Arch., 2017

Two-Round Iterative Characteristics for Linear Cryptanalysis of Modified DES with Embedded Parity Checks.
Electron. Notes Discret. Math., 2017

2016
Some new results on Hadamard modulo prime matrices.
Probl. Inf. Transm., 2016

2015
Linear Cryptanalysis and Modified DES with Embedded Parity Check in the S-boxes.
Proceedings of the Cryptography and Information Security in the Balkans, 2015

2012
Revisiting butson hadamard matrix construction based on a prominent class of pseudo-random sequences.
Proceedings of the CUBE International IT Conference & Exhibition, 2012

2011
On a Connection between Ideal Two-level Autocorrelation and Almost Balancedness of $p$-ary Sequences
CoRR, 2011

2010
A refinement of Cusick-Cheon bound for the second order binary Reed-Muller code.
Discret. Math., 2010

2009
Some Comments on Bossert-Mahr-Heilig Scheme.
Proceedings of the Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, 2009

On the Cusick-Cheon Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed-Muller Code.
IEEE Trans. Inf. Theory, 2009

On Jacket transforms over finite fields.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Fast Decoding of the <i>p</i>-Ary First-Order Reed-Muller Codes Based On Jacket Transform.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

On Cusick-Cheon's Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed-Muller Code
CoRR, 2008

2007
Bounds on Key Appearance Equivocation for Substitution Ciphers.
IEEE Trans. Inf. Theory, 2007

On Asymptotic Behavior of the Ratio Between the Numbers of Binary Primitive and Irreducible Polynomials.
IACR Cryptol. ePrint Arch., 2007

2006
Classification of cubic (n-4)-resilient Boolean functions.
IEEE Trans. Inf. Theory, 2006

2005
On the covering radii of binary Reed-Muller codes in the set of resilient Boolean functions.
IEEE Trans. Inf. Theory, 2005

Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Classification of Boolean Functions of 6 Variables or Less with Respect to Cryptographic Properties.
IACR Cryptol. ePrint Arch., 2004

Covering Radius of the (n-3)-rd Order Reed-Muller Code in the Set of Resilient Functions.
IACR Cryptol. ePrint Arch., 2004

2003
On the Non-minimal Codewords in Binary Reed-Muller Codes.
Discret. Appl. Math., 2003

On the Covering Radius of Second Order Binary Reed-Muller Code in the Set of Resilient Boolean Functions.
Proceedings of the Cryptography and Coding, 2003

2002
On a Resynchronization Weakness in a Class of Combiners with Memory.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

2001
On the Non-Minimal codewords of weight 2d<sub>min</sub> in the binary Reed-Muller Code.
Electron. Notes Discret. Math., 2001


  Loading...