default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAyineedi Venkateswarlu
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j15]Ayineedi Venkateswarlu, Abhishek Kesarwani, Sumanta Sarkar:
On the Lower Bound of Cost of MDS Matrices. IACR Trans. Symmetric Cryptol. 2022(4): 266-290 (2022)- 2021
- [j14]Abhishek Kesarwani
, Sumit Kumar Pandey, Santanu Sarkar, Ayineedi Venkateswarlu:
Recursive MDS matrices over finite commutative rings. Discret. Appl. Math. 304: 384-396 (2021)
2010 – 2019
- 2019
- [j13]Kishan Chand Gupta, Sumit Kumar Pandey, Ayineedi Venkateswarlu:
Almost involutory recursive MDS diffusion layers. Des. Codes Cryptogr. 87(2-3): 609-626 (2019) - [j12]Abhishek Kesarwani, Santanu Sarkar, Ayineedi Venkateswarlu:
Exhaustive Search for Various Types of MDS Matrices. IACR Trans. Symmetric Cryptol. 2019(3): 231-256 (2019) - [c4]Abhishek Kesarwani, Santanu Sarkar, Ayineedi Venkateswarlu:
Some Cryptanalytic Results on TRIAD. INDOCRYPT 2019: 160-174 - 2017
- [j11]Kishan Chand Gupta, Sumit Kumar Pandey, Ayineedi Venkateswarlu:
On the direct construction of recursive MDS matrices. Des. Codes Cryptogr. 82(1-2): 77-94 (2017) - [j10]Santanu Sarkar, Ayineedi Venkateswarlu:
Revisiting (nested) Roos bias in RC4 key scheduling algorithm. Des. Codes Cryptogr. 82(1-2): 131-148 (2017) - [j9]Kishan Chand Gupta, Sumit Kumar Pandey, Ayineedi Venkateswarlu:
Towards a general construction of recursive MDS diffusion layers. Des. Codes Cryptogr. 82(1-2): 179-195 (2017) - [j8]Ayineedi Venkateswarlu, Santanu Sarkar, Sai Mali Ananthanarayanan:
On acyclic edge-coloring of complete bipartite graphs. Discret. Math. 340(3): 481-493 (2017) - 2016
- [j7]Ayineedi Venkateswarlu, Santanu Sarkar:
On acyclic edge-coloring of the complete bipartite graphs K2p-1, 2p-1 for odd prime p. Discret. Math. 339(1): 72-77 (2016) - 2015
- [i1]Ayineedi Venkateswarlu, Santanu Sarkar, A. Sai Mali:
On Acyclic Edge-Coloring of Complete Bipartite Graphs. CoRR abs/1503.03283 (2015) - 2014
- [j6]Mahabir Prasad Jhanwar, Ayineedi Venkateswarlu, Reihaneh Safavi-Naini:
Paillier-based publicly verifiable (non-interactive) secret sharing. Des. Codes Cryptogr. 73(2): 529-546 (2014) - [c3]Santanu Sarkar, Ayineedi Venkateswarlu:
Partial Key Exposure Attack on CRT-RSA. INDOCRYPT 2014: 255-264 - 2010
- [j5]Ayineedi Venkateswarlu, Harald Niederreiter:
Improved results on periodic multisequences with large error linear complexity. Finite Fields Their Appl. 16(6): 463-476 (2010)
2000 – 2009
- 2008
- [j4]Harald Niederreiter, Ayineedi Venkateswarlu:
Periodic multisequences with large error linear complexity. Des. Codes Cryptogr. 49(1-3): 33-45 (2008) - 2007
- [j3]Wilfried Meidl, Ayineedi Venkateswarlu:
Remarks on the k-error linear complexity of pn-periodic sequences. Des. Codes Cryptogr. 42(2): 181-193 (2007) - [j2]Wilfried Meidl, Harald Niederreiter, Ayineedi Venkateswarlu:
Error linear complexity measures for multisequences. J. Complex. 23(2): 169-192 (2007) - 2005
- [j1]Subhamoy Maitra, Kishan Chand Gupta, Ayineedi Venkateswarlu:
Results on multiples of primitive polynomials and their products over GF(2). Theor. Comput. Sci. 341(1-3): 311-343 (2005) - 2002
- [c2]Ayineedi Venkateswarlu, Subhamoy Maitra:
Further Results on Multiples of Primitive Polynomials and Their Products over GF(2). ICICS 2002: 231-242 - [c1]Subhamoy Maitra, Kishan Chand Gupta, Ayineedi Venkateswarlu:
Multiples of Primitive Polynomials and Their Products over GF(2). Selected Areas in Cryptography 2002: 214-231
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
