( en | de | ru )

 

Disambiguation of "Borissov, Yuri L."

Author of the publication

copydeleteadd this publication to your clipboard
On a Resynchronization Weakness in a Class of Combiners with Memory.

, , , and . SCN, volume 2576 of Lecture Notes in Computer Science, page 164-173. Springer, (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Denis Yurin

José Antonio Yuri Salomón

Yuri Yamanaka

Yuri Suris

Yuri Estrin

 

Other publications of authors with the same name

On a Connection between Ideal Two-level Autocorrelation and Almost Balancedness of $p$-ary Sequences. CoRR, (2011)On the Covering Radius of Second Order Binary Reed-Muller Code in the Set of Resilient Boolean Functions., , , and . IMACC, volume 2898 of Lecture Notes in Computer Science, page 82-92. Springer, (2003)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)An Approach for Computing the Number of Points on Elliptic Curve y2 = x3 + a (mod p) via Explicit Formula for That Number Modulo p., and . IWSDA, page 1-5. IEEE, (2019)Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties., , , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 324-334. Springer, (2005)Linear Cryptanalysis and Modified DES with Embedded Parity Check in the S-boxes., , and . BalkanCryptSec, volume 9540 of Lecture Notes in Computer Science, page 60-78. Springer, (2015)On Cusick-Cheon's Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed-Muller Code. CoRR, (2008)An O(log2 p) Approach to Point-Counting on Elliptic Curves From a Prominent Family Over the Prime Field 픽p., and . IACR Cryptol. ePrint Arch., (2021)Revisiting butson hadamard matrix construction based on a prominent class of pseudo-random sequences., and . CUBE, page 11-16. ACM, (2012)On the Non-minimal Codewords in Binary Reed-Muller Codes., , and . Discret. Appl. Math., 128 (1): 65-74 (2003)