Ayineedi Venkateswarlu

Orcid: 0000-0003-3178-0727

According to our database1, Ayineedi Venkateswarlu authored at least 19 papers between 2002 and 2022.

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

2022
On the Lower Bound of Cost of MDS Matrices.
IACR Trans. Symmetric Cryptol., 2022

2021
Recursive MDS matrices over finite commutative rings.
Discret. Appl. Math., 2021

2019
Exhaustive Search for Various Types of MDS Matrices.
IACR Trans. Symmetric Cryptol., 2019

Almost involutory recursive MDS diffusion layers.
Des. Codes Cryptogr., 2019

Some Cryptanalytic Results on TRIAD.
Proceedings of the Progress in Cryptology - INDOCRYPT 2019, 2019

2017
On acyclic edge-coloring of complete bipartite graphs.
Discret. Math., 2017

Revisiting (nested) Roos bias in RC4 key scheduling algorithm.
Des. Codes Cryptogr., 2017

Towards a general construction of recursive MDS diffusion layers.
Des. Codes Cryptogr., 2017

On the direct construction of recursive MDS matrices.
Des. Codes Cryptogr., 2017

2016
On acyclic edge-coloring of the complete bipartite graphs K<sub>2p-1, 2p-1</sub> for odd prime p.
Discret. Math., 2016

2014
Paillier-based publicly verifiable (non-interactive) secret sharing.
Des. Codes Cryptogr., 2014

Partial Key Exposure Attack on CRT-RSA.
Proceedings of the Progress in Cryptology - INDOCRYPT 2014, 2014

2010
Improved results on periodic multisequences with large error linear complexity.
Finite Fields Their Appl., 2010

2008
Periodic multisequences with large error linear complexity.
Des. Codes Cryptogr., 2008

2007
Error linear complexity measures for multisequences.
J. Complex., 2007

Remarks on the <i>k</i>-error linear complexity of <i>p</i><sup><i>n</i></sup>-periodic sequences.
Des. Codes Cryptogr., 2007

2005
Results on multiples of primitive polynomials and their products over GF(2).
Theor. Comput. Sci., 2005

2002
Multiples of Primitive Polynomials and Their Products over GF(2).
Proceedings of the Selected Areas in Cryptography, 2002

Further Results on Multiples of Primitive Polynomials and Their Products over GF(2).
Proceedings of the Information and Communications Security, 4th International Conference, 2002


  Loading...