Pradeep Kumar Mishra |
|
|---|---|
| 8 papers in database with 124 citations H-number: 4 | |
Conference Papers |
|
| 1. Pradeep Kumar Mishra, Vassil S. Dimitrov, A Graph Theoretic Analysis of Double Base Number Systems, pp. 152 - 166, INDOCRYPT 2007. [  Electronic
Edition][ Cited
3 times
] | |
| 2. Kishan Chand Gupta, Pradeep Kumar Mishra, Pinakpani Pal, A General Methodology for Pipelining the Point Multiplication Operation in Curve Based Cryptography, pp. 405 - 420, ACNS 2006. [ Electronic
Edition][No
citation] | |
| 3. Vassil S. Dimitrov, Laurent Imbert, Pradeep Kumar Mishra, Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains, pp. 59 - 78, ASIACRYPT 2005. [ Electronic
Edition][ IACR Online
Archive ][Cited
72 times
 ] | |
| 4. 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, pp. 403 - 416, INDOCRYPT 2005. [ Electronic
Edition][Cited
3 times
] | |
| 5. Pradeep Kumar Mishra, Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems, pp. 328 - 342, CHES 2004. [ Electronic
Edition][Cited
23 times
] | |
| 6. Palash Sarkar, Pradeep Kumar Mishra, Rana Barua, New Table Look-Up Methods for Faster Frobenius Map Based Scalar Multiplication Over GF(p, pp. 479 - 493, ACNS 2004. [ Electronic
Edition][Cited
1 times
] | |
| 7. Pradeep Kumar Mishra, Palash Sarkar, Application of Montgomery's Trick to Scalar Multiplication for Elliptic and Hyperelliptic Curves Using a Fixed Base Point, pp. 41 - 54, PKC 2004. [ Electronic
Edition][IACR Online
Archive][Cited
5 times
] | |
| 8. Pradeep Kumar Mishra, Palash Sarkar, Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves, pp. 93 - 110, ASIACRYPT 2003. [ Electronic
Edition][IACR Online
Archive][Cited
17 times
] | |
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals