Classification of Boolean functions of 6 variables or less with respect to some cryptographic properties A Braeken, Y Borissov, S Nikova, B Preneel International colloquium on automata, languages, and programming, 324-334, 2005 | 62 | 2005 |

On the covering radii of binary Reed-Muller codes in the set of resilient Boolean functions Y Borissov, A Braeken, S Nikova, B Preneel IEEE Transactions on Information Theory 51 (3), 1182-1189, 2005 | 29 | 2005 |

On the non-minimal codewords in binary Reed–Muller codes Y Borissov, N Manev, S Nikova Discrete applied mathematics 128 (1), 65-74, 2003 | 21 | 2003 |

A proof of non-existence of bordered jacket matrices of odd order over some fields MH Lee, YL Borissov Electronics letters 46 (5), 349-351, 2010 | 16 | 2010 |

Minimal codewords in linear codes Y Borissov, N Manev Serdica Mathematical Journal 30 (2-3), 303p-324p, 2004 | 16 | 2004 |

Classification of cubic (n-4)-resilient Boolean functions A Braeken, Y Borissov, S Nikova, B Preneel IEEE transactions on information theory 52 (4), 1670-1676, 2006 | 14 | 2006 |

Class of jacket matrices over finite characteristic fields MH Lee, YL Borissov, SM Dodunekov Electronics letters 46 (13), 916-918, 2010 | 12 | 2010 |

Plaintext recovery in des-like cryptosystems based on s-boxes with embedded parity check V Angelova, Y Borissov Serdica Journal of Computing 7 (3), 257p-270p, 2013 | 9 | 2013 |

Bounds on key appearance equivocation for substitution ciphers YL Borissov, MH Lee IEEE transactions on information theory 53 (6), 2294-2296, 2007 | 8 | 2007 |

Classification of cubic Boolean functions in 7 variables A Braeken, S Nikova, Y Borissov, B Preneel Proc. of the 26th Symposium on Information Theory in the Benelux 2005, May …, 2005 | 8 | 2005 |

On a resynchronization weakness in a class of combiners with memory Y Borissov, S Nikova, B Preneel, J Vandewalle International Conference on Security in Communication Networks, 164-173, 2002 | 8 | 2002 |

On Jacket transforms over finite fields MH Lee, YL Borissov 2009 IEEE International Symposium on Information Theory, 2803-2807, 2009 | 7 | 2009 |

On the covering radius of second order binary Reed-Muller code in the set of resilient Boolean functions Y Borissov, A Braeken, S Nikova, B Preneel IMA International Conference on Cryptography and Coding, 82-92, 2003 | 6 | 2003 |

Minimal/nonminimal codewords in the second order binary Reed-Muller codes: revisited Y Borissov Proceedings of the Eleventh International Workshop on Algebraic and …, 2008 | 5 | 2008 |

An Approach for Computing the Number of Points on Elliptic Curve y^{2} = x^{3} + a (mod p) via Explicit Formula for That Number Modulo pY Borissov, M Markov 2019 Ninth International Workshop on Signal Design and its Applications in …, 2019 | 4 | 2019 |

On the minimal words of the primitive BCH codes Y Borissov, NL Manev Proceedings of IEEE International Symposium on Information Theory, 86, 1997 | 4 | 1997 |

Linear Cryptanalysis and Modified DES with Embedded Parity Check in the S-boxes Y Borissov, P Boyvalenkov, R Tsenkov International Conference on Cryptography and Information Security in the …, 2015 | 3 | 2015 |

On the Cusick–Cheon conjecture about balanced Boolean functions in the cosets of the binary Reed–Muller code YL Borissov IEEE transactions on information theory 55 (1), 16-18, 2008 | 3 | 2008 |

Fast Decoding of the *p*-Ary First-Order Reed-Muller Codes Based On Jacket TransformMH Lee, YL Borissov IEICE transactions on fundamentals of electronics, communications and …, 2008 | 3 | 2008 |

Covering Radius of the (n-3)-rd Order Reed-Muller Code in the Set of Resilient Functions. YL Borissov, A Braeken, S Nikova IACR Cryptol. ePrint Arch. 2004, 202, 2004 | 3 | 2004 |