Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Ayineedi Venkateswarlu
@article{DBLP:journals/tosc/VenkateswarluKS22, author = {Ayineedi Venkateswarlu and Abhishek Kesarwani and Sumanta Sarkar}, title = {On the Lower Bound of Cost of {MDS} Matrices}, journal = {{IACR} Trans. Symmetric Cryptol.}, volume = {2022}, number = {4}, pages = {266--290}, year = {2022}, url = {https://doi.org/10.46586/tosc.v2022.i4.266-290}, doi = {10.46586/TOSC.V2022.I4.266-290}, timestamp = {Fri, 22 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tosc/VenkateswarluKS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KesarwaniPSV21, author = {Abhishek Kesarwani and Sumit Kumar Pandey and Santanu Sarkar and Ayineedi Venkateswarlu}, title = {Recursive {MDS} matrices over finite commutative rings}, journal = {Discret. Appl. Math.}, volume = {304}, pages = {384--396}, year = {2021}, url = {https://doi.org/10.1016/j.dam.2021.08.016}, doi = {10.1016/J.DAM.2021.08.016}, timestamp = {Fri, 22 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/KesarwaniPSV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcc/GuptaPV19, author = {Kishan Chand Gupta and Sumit Kumar Pandey and Ayineedi Venkateswarlu}, title = {Almost involutory recursive {MDS} diffusion layers}, journal = {Des. Codes Cryptogr.}, volume = {87}, number = {2-3}, pages = {609--626}, year = {2019}, url = {https://doi.org/10.1007/s10623-018-0582-2}, doi = {10.1007/S10623-018-0582-2}, timestamp = {Mon, 17 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcc/GuptaPV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tosc/Kesarwani0V19, author = {Abhishek Kesarwani and Santanu Sarkar and Ayineedi Venkateswarlu}, title = {Exhaustive Search for Various Types of {MDS} Matrices}, journal = {{IACR} Trans. Symmetric Cryptol.}, volume = {2019}, number = {3}, pages = {231--256}, year = {2019}, url = {https://doi.org/10.13154/tosc.v2019.i3.231-256}, doi = {10.13154/TOSC.V2019.I3.231-256}, timestamp = {Fri, 22 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tosc/Kesarwani0V19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/indocrypt/Kesarwani0V19, author = {Abhishek Kesarwani and Santanu Sarkar and Ayineedi Venkateswarlu}, editor = {Feng Hao and Sushmita Ruj and Sourav Sen Gupta}, title = {Some Cryptanalytic Results on {TRIAD}}, booktitle = {Progress in Cryptology - {INDOCRYPT} 2019 - 20th International Conference on Cryptology in India, Hyderabad, India, December 15-18, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11898}, pages = {160--174}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-35423-7\_8}, doi = {10.1007/978-3-030-35423-7\_8}, timestamp = {Wed, 20 Mar 2024 15:23:22 +0100}, biburl = {https://dblp.org/rec/conf/indocrypt/Kesarwani0V19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcc/GuptaPV17, author = {Kishan Chand Gupta and Sumit Kumar Pandey and Ayineedi Venkateswarlu}, title = {On the direct construction of recursive {MDS} matrices}, journal = {Des. Codes Cryptogr.}, volume = {82}, number = {1-2}, pages = {77--94}, year = {2017}, url = {https://doi.org/10.1007/s10623-016-0233-4}, doi = {10.1007/S10623-016-0233-4}, timestamp = {Mon, 17 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcc/GuptaPV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcc/SarkarV17, author = {Santanu Sarkar and Ayineedi Venkateswarlu}, title = {Revisiting (nested) Roos bias in {RC4} key scheduling algorithm}, journal = {Des. Codes Cryptogr.}, volume = {82}, number = {1-2}, pages = {131--148}, year = {2017}, url = {https://doi.org/10.1007/s10623-016-0219-2}, doi = {10.1007/S10623-016-0219-2}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcc/SarkarV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcc/GuptaPV17a, author = {Kishan Chand Gupta and Sumit Kumar Pandey and Ayineedi Venkateswarlu}, title = {Towards a general construction of recursive {MDS} diffusion layers}, journal = {Des. Codes Cryptogr.}, volume = {82}, number = {1-2}, pages = {179--195}, year = {2017}, url = {https://doi.org/10.1007/s10623-016-0261-0}, doi = {10.1007/S10623-016-0261-0}, timestamp = {Mon, 17 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcc/GuptaPV17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/VenkateswarluSA17, author = {Ayineedi Venkateswarlu and Santanu Sarkar and Sai Mali Ananthanarayanan}, title = {On acyclic edge-coloring of complete bipartite graphs}, journal = {Discret. Math.}, volume = {340}, number = {3}, pages = {481--493}, year = {2017}, url = {https://doi.org/10.1016/j.disc.2016.08.026}, doi = {10.1016/J.DISC.2016.08.026}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/VenkateswarluSA17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/VenkateswarluS16, author = {Ayineedi Venkateswarlu and Santanu Sarkar}, title = {On acyclic edge-coloring of the complete bipartite graphs K\({}_{\mbox{2p-1, 2p-1}}\) for odd prime p}, journal = {Discret. Math.}, volume = {339}, number = {1}, pages = {72--77}, year = {2016}, url = {https://doi.org/10.1016/j.disc.2015.07.010}, doi = {10.1016/J.DISC.2015.07.010}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/VenkateswarluS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/VenkateswarluSM15, author = {Ayineedi Venkateswarlu and Santanu Sarkar and A. Sai Mali}, title = {On Acyclic Edge-Coloring of Complete Bipartite Graphs}, journal = {CoRR}, volume = {abs/1503.03283}, year = {2015}, url = {http://arxiv.org/abs/1503.03283}, eprinttype = {arXiv}, eprint = {1503.03283}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/VenkateswarluSM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcc/JhanwarVS14, author = {Mahabir Prasad Jhanwar and Ayineedi Venkateswarlu and Reihaneh Safavi{-}Naini}, title = {Paillier-based publicly verifiable (non-interactive) secret sharing}, journal = {Des. Codes Cryptogr.}, volume = {73}, number = {2}, pages = {529--546}, year = {2014}, url = {https://doi.org/10.1007/s10623-014-9952-6}, doi = {10.1007/S10623-014-9952-6}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcc/JhanwarVS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/indocrypt/SarkarV14, author = {Santanu Sarkar and Ayineedi Venkateswarlu}, editor = {Willi Meier and Debdeep Mukhopadhyay}, title = {Partial Key Exposure Attack on {CRT-RSA}}, booktitle = {Progress in Cryptology - {INDOCRYPT} 2014 - 15th International Conference on Cryptology in India, New Delhi, India, December 14-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8885}, pages = {255--264}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13039-2\_15}, doi = {10.1007/978-3-319-13039-2\_15}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/indocrypt/SarkarV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ffa/VenkateswarluN10, author = {Ayineedi Venkateswarlu and Harald Niederreiter}, title = {Improved results on periodic multisequences with large error linear complexity}, journal = {Finite Fields Their Appl.}, volume = {16}, number = {6}, pages = {463--476}, year = {2010}, url = {https://doi.org/10.1016/j.ffa.2010.09.002}, doi = {10.1016/J.FFA.2010.09.002}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ffa/VenkateswarluN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcc/NiederreiterV08, author = {Harald Niederreiter and Ayineedi Venkateswarlu}, title = {Periodic multisequences with large error linear complexity}, journal = {Des. Codes Cryptogr.}, volume = {49}, number = {1-3}, pages = {33--45}, year = {2008}, url = {https://doi.org/10.1007/s10623-008-9174-x}, doi = {10.1007/S10623-008-9174-X}, timestamp = {Mon, 17 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcc/NiederreiterV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcc/MeidlV07, author = {Wilfried Meidl and Ayineedi Venkateswarlu}, title = {Remarks on the \emph{k}-error linear complexity of \emph{p}\({}^{\mbox{\emph{n}}}\)-periodic sequences}, journal = {Des. Codes Cryptogr.}, volume = {42}, number = {2}, pages = {181--193}, year = {2007}, url = {https://doi.org/10.1007/s10623-006-9029-2}, doi = {10.1007/S10623-006-9029-2}, timestamp = {Mon, 17 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcc/MeidlV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jc/MeidlNV07, author = {Wilfried Meidl and Harald Niederreiter and Ayineedi Venkateswarlu}, title = {Error linear complexity measures for multisequences}, journal = {J. Complex.}, volume = {23}, number = {2}, pages = {169--192}, year = {2007}, url = {https://doi.org/10.1016/j.jco.2006.10.005}, doi = {10.1016/J.JCO.2006.10.005}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jc/MeidlNV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MaitraGV05, author = {Subhamoy Maitra and Kishan Chand Gupta and Ayineedi Venkateswarlu}, title = {Results on multiples of primitive polynomials and their products over {GF(2)}}, journal = {Theor. Comput. Sci.}, volume = {341}, number = {1-3}, pages = {311--343}, year = {2005}, url = {https://doi.org/10.1016/j.tcs.2005.04.011}, doi = {10.1016/J.TCS.2005.04.011}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MaitraGV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icics/VenkateswarluM02, author = {Ayineedi Venkateswarlu and Subhamoy Maitra}, editor = {Robert H. Deng and Sihan Qing and Feng Bao and Jianying Zhou}, title = {Further Results on Multiples of Primitive Polynomials and Their Products over {GF(2)}}, booktitle = {Information and Communications Security, 4th International Conference, {ICICS} 2002, Singapore, December 9-12, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2513}, pages = {231--242}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36159-6\_20}, doi = {10.1007/3-540-36159-6\_20}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/icics/VenkateswarluM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sacrypt/MaitraGV02, author = {Subhamoy Maitra and Kishan Chand Gupta and Ayineedi Venkateswarlu}, editor = {Kaisa Nyberg and Howard M. Heys}, title = {Multiples of Primitive Polynomials and Their Products over {GF(2)}}, booktitle = {Selected Areas in Cryptography, 9th Annual International Workshop, {SAC} 2002, St. John's, Newfoundland, Canada, August 15-16, 2002. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2595}, pages = {214--231}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36492-7\_15}, doi = {10.1007/3-540-36492-7\_15}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/sacrypt/MaitraGV02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.