S
Saroj Kumar Panigrahy
Researcher at National Institute of Technology, Rourkela
Publications - 32
Citations - 440
Saroj Kumar Panigrahy is an academic researcher from National Institute of Technology, Rourkela. The author has contributed to research in topics: Authentication & Message authentication code. The author has an hindex of 9, co-authored 28 publications receiving 403 citations. Previous affiliations of Saroj Kumar Panigrahy include Roland Institute of Technology & VIT University.
Papers
More filters
Image Encryption Using Advanced Hill Cipher Algorithm
TL;DR: A novel advanced Hill (AdvHill) encryption technique has been proposed which uses an involutory key matrix and is a fast encryption scheme which overcomes problems of encrypting the images with homogeneous background.
Novel Methods of Generating Self-Invertible Matrix for Hill Cipher Algorithm
TL;DR: Methods of generating self-invertible matrix for Hill Cipher algorithm have been proposed, which eliminates the computational complexity involved in finding inverse of the matrix while decryption.
Image Encryption Using Self-Invertible Key Matrix of Hill Cipher Algorithm
TL;DR: This paper presented a proposed method of generating self-invertible matrix for Hill Cipher algorithm and eliminates the computational complexity involved in finding inverse of the matrix while decryption.
Proceedings ArticleDOI
Improved offline signature verification scheme using feature point extraction method
TL;DR: An offline signature verification scheme based on selecting 60 feature points from the geometric centre of the signature and compares them with the already trained feature points to reduce the two vital parameters False Acceptance Rate (FAR) and False Rejection Rate (FRR).
Proceedings ArticleDOI
A secure and efficient message authentication protocol for VANETs with privacy preservation
TL;DR: A secure and efficient protocol for vehicular ad hoc networks has been proposed that ensures both message authentication and privacy preservation and outperforms existing algorithms based on integer factoring and discrete logarithmic problem.