P. R. Mishra
Research Subjects
Research Interests
P. R. Mishra has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Atul Gaur
Department of Mathematics University of Delhi 110007 Delhi
3 shared publications - Yogesh Kumar
Scientific Analysis Group DRDO Metcalfe House Complex 110054 Delhi
3 shared publications - Arvind Kumar
DRDO, Sci Anal Grp, Metcalfe House, Delhi 110054, India
2 shared publications - Odelu Ojjela
Department of Applied Mathematics Defence Institute of Advanced Technology (Deemed to be University) Pune India
2 shared publications - Susanta Samanta
University of Waterloo
2 shared publications - Dimpy Chauhan
Department of Mathematics, University of Delhi, Delhi, India
1 shared publication
Latest Publications
- 1 October 2025
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 110
On the study of semi-involutory and semi-orthogonal matrices
- 1 October 2025
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 110
On the study of semi-involutory and semi-orthogonal matrices
- 10 September 2024
- Published by Springer Nature
- p. 187-205
A New Algorithm for Computing Branch Number of Non-Singular Matrices Over Finite Fields
- 10 September 2024
- Published by Springer Nature
- p. 187-205
A New Algorithm for Computing Branch Number of Non-Singular Matrices Over Finite Fields
- Open Access
- 16 October 2023
- Published by Defence Scientific Information and Documentation Centre in Defence Science Journal
- Vol. 74 (01) , 68-78
Construction of New Hadamard Matrix Forms to Generate 4X4 and 8X8 Involutory MDS Matrices over GF (2m) for Lightweight Cryptography
In this paper, we present the construction of two Hadamard matrix forms over GF(2m) to generate 4×4 and 8×8 involutory MDS (IMDS) matrices. The first form provides a straightforward way to generate 4×4 IMDS matrices, while the second is an efficient way to generate 8×8 IMDS matrices using a hybrid (combination of search-based methods and direct construction) approach. In addition, we propose an algorithm for computing the branch number of any non-singular matrix over GF(2m) and improve its computational complexity for Hadamard matrices. Using this algorithm and the proposed Hadamard matrix form, we obtain 2k ×2k lightweight involutory and non-involutory Hadamard MDS matrices with low XOR counts for k=2,3. Finally, we carry out a comparative study based on the XOR count to demonstrate that MDS matrices created using our Hadamard matrix forms have lower XOR counts than MDS matrices available in the literature as of today.
- 16 October 2023
- Published by Defence Scientific Information and Documentation Centre in Defence Science Journal
- Vol. 74 (01) , 68-78
Open AccessConstruction of New Hadamard Matrix Forms to Generate 4X4 and 8X8 Involutory MDS Matrices over GF (2m) for Lightweight Cryptography
In this paper, we present the construction of two Hadamard matrix forms over GF(2m) to generate 4×4 and 8×8 involutory MDS (IMDS) matrices. The first form provides a straightforward way to generate 4×4 IMDS matrices, while the second is an efficient way to generate 8×8 IMDS matrices using a hybrid (combination of search-based methods and direct construction) approach. In addition, we propose an algorithm for computing the branch number of any non-singular matrix over GF(2m) and improve its computational complexity for Hadamard matrices. Using this algorithm and the proposed Hadamard matrix form, we obtain 2k ×2k lightweight involutory and non-involutory Hadamard MDS matrices with low XOR counts for k=2,3. Finally, we carry out a comparative study based on the XOR count to demonstrate that MDS matrices created using our Hadamard matrix forms have lower XOR counts than MDS matrices available in the literature as of today.
- 24 August 2023
- Published by Taylor & Francis in Cryptologia
- Vol. 48 (5) , 437-468
An ultra-lightweight block cipher with string transformations
- 24 August 2023
- Published by Taylor & Francis in Cryptologia
- Vol. 48 (5) , 437-468
An ultra-lightweight block cipher with string transformations
- 10 February 2023
- Published by Taylor & Francis in Cryptologia
- Vol. 48 (2) , 173-192
Bit inclusion test: an enhanced avalanche test for stream ciphers
In this paper, we present a new test for stream ciphers named the ‘Bit Inclusion Test (BIT)’. This test provides an enhancement to the conventional avalanche test for stream ciphers. This test is efficient and includes the conventional avalanche test. Additionally, it can capture the shortcomings which escape the conventional avalanche test. We also demonstrate, with examples, how BIT is capable of going deeper into the structure of crypto-algorithms and detecting internal biases which make an algorithm susceptible to cryptanalytic attacks.
- 10 February 2023
- Published by Taylor & Francis in Cryptologia
- Vol. 48 (2) , 173-192
Bit inclusion test: an enhanced avalanche test for stream ciphers
In this paper, we present a new test for stream ciphers named the ‘Bit Inclusion Test (BIT)’. This test provides an enhancement to the conventional avalanche test for stream ciphers. This test is efficient and includes the conventional avalanche test. Additionally, it can capture the shortcomings which escape the conventional avalanche test. We also demonstrate, with examples, how BIT is capable of going deeper into the structure of crypto-algorithms and detecting internal biases which make an algorithm susceptible to cryptanalytic attacks.
- 18 May 2022
- Published by Taylor & Francis in Cryptologia
- Vol. 47 (5) , 1-17
Analysis of rotation and shift based diffusion functions
‘Rotation and shift’ based diffusion functions are used in modern ciphers especially in ARX (Addition, Rotation, and XOR) based designs. They are preferred over other alternatives as they are efficient and lightweight. Usually, such diffusion functions map an n-bit block to another n-bit block. One of the requirements for an n-bit to n-bit diffusion function is that, it should be invertible. In this paper, we present mathematical models for different classes of ‘rotation and shift’ based diffusion functions and explore their invertibility. We derive sufficient conditions under which diffusion functions of these classes are invertible.
- 18 May 2022
- Published by Taylor & Francis in Cryptologia
- Vol. 47 (5) , 1-17
Analysis of rotation and shift based diffusion functions
‘Rotation and shift’ based diffusion functions are used in modern ciphers especially in ARX (Addition, Rotation, and XOR) based designs. They are preferred over other alternatives as they are efficient and lightweight. Usually, such diffusion functions map an n-bit block to another n-bit block. One of the requirements for an n-bit to n-bit diffusion function is that, it should be invertible. In this paper, we present mathematical models for different classes of ‘rotation and shift’ based diffusion functions and explore their invertibility. We derive sufficient conditions under which diffusion functions of these classes are invertible.