Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Pradeep Kumar Mishra
2000 – 2009
- 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 Cryptology ePrint Archive 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 Cryptology ePrint Archive 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 Cryptology ePrint Archive 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 Cryptology ePrint Archive 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 Cryptology ePrint Archive 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 Cryptology ePrint Archive 2003: 180 (2003)
- [i1]Pradeep Kumar Mishra, Palash Sarkar: Inversion of Several Field Elements: A New Parallel Algorithm. IACR Cryptology ePrint Archive 2003: 264 (2003)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:08 CET by the dblp team