default search action
Pradeep Kumar Mishra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j9]Kulmani Mehar
, Pradeep Kumar Mishra, Subrata Kumar Panda:
Thermal buckling strength of smart nanotube-reinforced doubly curved hybrid composite panels. Comput. Math. Appl. 90: 13-24 (2021) - [j8]Pradeep Kumar Mishra, Deevashwer Rathee, Dung Hoang Duong, Masaya Yasuda:
Fast secure matrix multiplications over ring-based homomorphic encryption. Inf. Secur. J. A Glob. Perspect. 30(4): 219-234 (2021) - 2020
- [j7]Huy Quoc Le
Impact of the modulus switching technique on some attacks against learning problems. IET Inf. Secur. 14(3): 286-303 (2020)
2010 – 2019
- 2019
- [j6]Jagadish Bandaru
A Real-Time Health 4.0 Framework with Novel Feature Extraction and Classification for Brain-Controlled IoT-Enabled Environments. Neural Comput. 31(10): 1915-1944 (2019) - 2018
- [j5]M. Amarlingam, Pradeep Kumar Mishra
Novel Light Weight Compressed Data Aggregation using sparse measurements for IoT networks. J. Netw. Comput. Appl. 121: 119-134 (2018) - [c21]Huy Quoc Le
Solving LWR via BDD Strategy: Modulus Switching Approach. CANS 2018: 357-376 - [c20]Pradeep Kumar Mishra, Jagadish Bandaru
A Novel Classification for EEG Based Four Class Motor Imagery Using Kullback-Leibler Regularized Riemannian Manifold. HealthCom 2018: 1-5 - [c19]Amarlingam Madapu, Pradeep Kumar Mishra
Energy efficient wireless sensor networks utilizing adaptive dictionary in compressed sensing. WF-IoT 2018: 383-388 - [c18]Deevashwer Rathee, Pradeep Kumar Mishra, Masaya Yasuda:
Faster PCA and Linear Regression through Hypercubes in HElib. WPES@CCS 2018: 42-53 - [i9]Pradeep Kumar Mishra, Deevashwer Rathee, Dung Hoang Duong, Masaya Yasuda:
Fast Secure Matrix Multiplications over Ring-Based Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2018: 663 (2018) - [i8]Deevashwer Rathee, Pradeep Kumar Mishra, Masaya Yasuda:
Faster PCA and Linear Regression through Hypercubes in HElib. IACR Cryptol. ePrint Arch. 2018: 801 (2018) - 2017
- [c17]Pradeep Kumar Mishra, Dung Hoang Duong
Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption. ISPEC 2017: 320-330 - 2016
- [c16]Kalloor Joseph Francis
A simple and accurate matrix for model based photoacoustic imaging. HealthCom 2016: 1-5 - [c15]M. Amarlingam, Pradeep Kumar Mishra
Compressed sensing for different sensors: A real scenario for WSN and IoT. WF-IoT 2016: 289-294 - 2015
- [c14]Pradeep Kumar Mishra
Compressive sensing ultrasound beamformed imaging in time and frequency domain. HealthCom 2015: 523-527 - [c13]Pradeep Kumar Mishra, Sanjeev Karmakar, Pulak Guhathakurta:
A Broad Literature Survey of Development and Application of Artificial Neural Networks in Rainfall-Runoff Modelling. SocProS (2) 2015: 691-710 - 2013
- [c12]Biplab Banerjee, Pradeep Kumar Mishra, Surender Varma G., Krishna Mohan Buddhiraju:
A Novel Graph Based Clustering Technique for Hybrid Segmentation of Multi-spectral Remotely Sensed Images. ACIVS 2013: 274-285
2000 – 2009
- 2008
- [j4]Pradeep Kumar Mishra, Vassil S. Dimitrov:
A combinatorial interpretation of double base number system and some consequences. Adv. Math. Commun. 2(2): 159-173 (2008) - [j3]Pradeep Kumar Mishra, Kishan Chand Gupta:
A metric on the set of elliptic curves over Fp. Appl. Math. Lett. 21(12): 1330-1332 (2008) - [j2]Vassil S. Dimitrov, Laurent Imbert, Pradeep Kumar Mishra:
The double-base number system and its application to elliptic curve cryptography. Math. Comput. 77(262): 1075-1104 (2008) - [i7]Jithra Adikari, Vassil S. Dimitrov, Pradeep Kumar Mishra:
Fast Multiple Point Multiplication on Elliptic Curves over Prime and Binary Fields using the Double-Base Number System. IACR Cryptol. ePrint Arch. 2008: 145 (2008) - 2007
- [c11]Pradeep Kumar Mishra, Vassil S. Dimitrov:
A Graph Theoretic Analysis of Double Base Number Systems. INDOCRYPT 2007: 152-166 - [c10]Pradeep Kumar Mishra, Pinakpani Pal, Palash Sarkar:
Towards Minimizing Memory Requirement for Implementation of Hyperelliptic Curve Cryptosystems. ISPEC 2007: 269-283 - [c9]Pradeep Kumar Mishra, Vassil S. Dimitrov:
Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation. ISC 2007: 390-406 - [i6]Pradeep Kumar Mishra, Vassil S. Dimitrov:
Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation. IACR Cryptol. ePrint Arch. 2007: 40 (2007) - 2006
- [j1]Pradeep Kumar Mishra:
Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems (Extended Version). IEEE Trans. Computers 55(8): 1000-1010 (2006) - [c8]Kishan Chand Gupta, Pradeep Kumar Mishra, Pinakpani Pal:
A General Methodology for Pipelining the Point Multiplication Operation in Curve Based Cryptography. ACNS 2006: 405-420 - [i5]Pradeep Kumar Mishra, Pinakpani Pal, Palash Sarkar:
Towards Minimizing Memory Requirement for Implementation of Hyperelliptic Curve Crytosystems. IACR Cryptol. ePrint Arch. 2006: 204 (2006) - 2005
- [c7]Vassil S. Dimitrov, Laurent Imbert, Pradeep Kumar Mishra:
Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains. ASIACRYPT 2005: 59-78 - [c6]Pradeep Kumar Mishra:
Efficient Simultaneous Inversion in Parallel and Application to Point Multiplication in ECC. CISC 2005: 324-335 - [c5]Tanja Lange, Pradeep Kumar Mishra:
SCA Resistant Parallel Explicit Formula for Addition and Doubling of Divisors in the Jacobian of Hyperelliptic Curves of Genus 2. INDOCRYPT 2005: 403-416 - [i4]Pradeep Kumar Mishra, Kishan Chand Gupta:
A Metric on the Set of Elliptic Curves over Fp. IACR Cryptol. ePrint Arch. 2005: 6 (2005) - 2004
- [c4]Palash Sarkar, Pradeep Kumar Mishra, Rana Barua:
New Table Look-Up Methods for Faster Frobenius Map Based Scalar Multiplication Over GF(pn). ACNS 2004: 479-493 - [c3]Pradeep Kumar Mishra:
Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems. CHES 2004: 328-342 - [c2]Pradeep Kumar Mishra, Palash Sarkar:
Application of Montgomery's Trick to Scalar Multiplication for Elliptic and Hyperelliptic Curves Using a Fixed Base Point. Public Key Cryptography 2004: 41-54 - [i3]Pradeep Kumar Mishra:
Scalar Multiplication in Elliptic Curve Cryptosystems: Pipelining with Pre-computations. IACR Cryptol. ePrint Arch. 2004: 191 (2004) - 2003
- [c1]Pradeep Kumar Mishra, Palash Sarkar:
Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves. ASIACRYPT 2003: 93-110 - [i2]Pradeep Kumar Mishra, Palash Sarkar:
Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves. IACR Cryptol. ePrint Arch. 2003: 180 (2003) - [i1]Pradeep Kumar Mishra, Palash Sarkar:
Inversion of Several Field Elements: A New Parallel Algorithm. IACR Cryptol. ePrint Arch. 2003: 264 (2003)
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-24 23:07 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: