default search action
Prasanna Raghaw Mishra 0001
Person information
- affiliation: Defence Research and Development Organisation, Scientific Analysis Group (DRDO), Metcalfe House Complex, Delhi, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Prachi Gupta, P. R. Mishra, Atul Gaur:
Bounds on the maximum nonlinearity of permutations on the rings ${\mathbb {Z}}_p$ and ${\mathbb {Z}}_{2p}$. Appl. Algebra Eng. Commun. Comput. 35(6): 859-874 (2024) - [j14]Prasanna Raghaw Mishra
, Arvind Kumar
Bit inclusion test: an enhanced avalanche test for stream ciphers. Cryptologia 48(2): 173-192 (2024) - [j13]Dimpy Chauhan
An ultra-lightweight block cipher with string transformations. Cryptologia 48(5): 437-468 (2024) - [j12]Yogesh Kumar
A systematic construction approach for all 4˟ 4 involutory MDS matrices. J. Appl. Math. Comput. 70(5): 4677-4697 (2024) - [c5]Prasanna Raghaw Mishra
A New Algorithm for Computing Branch Number of Non-Singular Matrices Over Finite Fields. SCN (2) 2024: 187-205 - [i9]Yogesh Kumar, Prasanna Raghaw Mishra, Susanta Samanta, Kishan Chand Gupta, Atul Gaur:
Construction of all MDS and involutory MDS matrices. CoRR abs/2403.10372 (2024) - [i8]Yogesh Kumar, Prasanna Raghaw Mishra, Susanta Samanta, Atul Gaur:
A Systematic Construction Approach for All 4⨉4 Involutory MDS Matrices. CoRR abs/2404.08250 (2024) - [i7]Prasanna Raghaw Mishra, Yogesh Kumar, Susanta Samanta, Atul Gaur:
A New Algorithm for Computing Branch Number of Non-Singular Matrices over Finite Fields. CoRR abs/2405.07007 (2024) - 2023
- [j11]Prasanna Raghaw Mishra, Prachi Gupta, Atul Gaur:
On full differential uniformity of permutations on the ring of integers modulo n. Appl. Algebra Eng. Commun. Comput. 34(2): 301-319 (2023) - [j10]Rajendra Kumar Sharma, Prasanna Raghaw Mishra, Yogesh Kumar:
A new class of differential 4-uniform permutations from exponential permutation. Appl. Algebra Eng. Commun. Comput. 34(6): 897-912 (2023) - [j9]Arvind Kumar
Analysis of rotation and shift based diffusion functions. Cryptologia 47(5): 419-435 (2023) - [j8]Prasanna Raghaw Mishra, Prachi Gupta, Atul Gaur:
Construction of highly nonlinear permutations on Z2p with differential uniformity at most 8. Finite Fields Their Appl. 92: 102305 (2023) - 2022
- [j7]Prasanna Raghaw Mishra, S. C. Ramola:
FCSR connection integers: efficient generation, testing and counting. Cryptologia 46(5): 439-460 (2022) - [j6]Dimpy Chauhan, Indivar Gupta, Prasanna Raghaw Mishra, Rashmi Verma:
Construction of cryptographically strong S-boxes from ternary quasigroups of order 4. Cryptologia 46(6): 525-551 (2022) - [j5]Prasanna Raghaw Mishra, Shashi Kant Pandey
On the algebraic immunity of multiplexer Boolean functions. J. Math. Cryptol. 16(1): 198-204 (2022) - [j4]Rajendra Kumar Sharma
Differential δ-uniformity and non-linearity of permutations over Zn. Theor. Comput. Sci. 936: 1-12 (2022) - 2021
- [c4]Prachi Gupta, Prasanna Raghaw Mishra, Atul Gaur:
On Differential Uniformity and Nonlinearity of Permutations on $\mathbb {Z}_{n}$. ICMC 2021: 627-636
2010 – 2019
- 2019
- [j3]Khushboo Bussi, Dhananjoy Dey
MGR Hash Functions. Cryptologia 43(5): 372-390 (2019) - [c3]Arvind Kumar, Prasanna Raghaw Mishra, Odelu Ojjela:
Analysis of Rotation-Based Diffusion Functions. SocProS (1) 2019: 215-225 - [i6]Prasanna Raghaw Mishra, Bhartendu Nandan, Navneet Gaba:
An Efficient and Compact Reformulation of NIST Collision Estimate Test. IACR Cryptol. ePrint Arch. 2019: 481 (2019) - [i5]Shashi Kant Pandey, Prasanna Raghaw Mishra:
Count of rotational symmetric bent Boolean functions. IACR Cryptol. ePrint Arch. 2019: 873 (2019) - [i4]Prasanna Raghaw Mishra, Bhartendu Nandan, Navneet Gaba:
On NIST's Compression Estimate Test. IACR Cryptol. ePrint Arch. 2019: 967 (2019) - 2018
- [j2]Prasanna Raghaw Mishra, Yogesh Kumar, N. Rajesh Pillai, Rajendra Kumar Sharma:
On non-linearity and affine equivalence of permutations over an arbitrary finite commutative ring with unity. Cryptologia 42(1): 81-94 (2018) - 2017
- [j1]Yogesh Kumar, Prasanna Raghaw Mishra, N. Rajesh Pillai, Rajendra Kumar Sharma:
Affine equivalence and non-linearity of permutations over Zn. Appl. Algebra Eng. Commun. Comput. 28(3): 257-279 (2017) - 2016
- [i3]Shashi Kant Pandey, Prasanna Raghaw Mishra, B. K. Dass:
A Maiorana-McFarland Construction of a GBF on Galois ring. IACR Cryptol. ePrint Arch. 2016: 97 (2016) - 2015
- [i2]Khushboo Bussi, Dhananjoy Dey, Prasanna Raghaw Mishra, B. K. Dass:
MGR HASH FUNCTION. IACR Cryptol. ePrint Arch. 2015: 856 (2015) - 2013
- [c2]Praneesh Gupta, Prasanna Raghaw Mishra:
Cryptanalysis of "A New Method of Cryptography Using Laplace Transform". SocProS (1) 2013: 539-546 - 2011
- [c1]Prasanna Raghaw Mishra, Indivar Gupta, N. Rajesh Pillai:
Generalized Avalanche Test for Stream Cipher Analysis. InfoSecHiComNet 2011: 168-180
2000 – 2009
- 2009
- [i1]Dhananjoy Dey, Prasanna Raghaw Mishra, Indranath Sen Gupta:
HF-hash : Hash Functions Using Restricted HFE Challenge-1. CoRR abs/0909.1392 (2009)
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-10-30 20:33 CET 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: