Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008 | ||
---|---|---|

13 | EE | Pradeep Kumar Mishra,
Kishan Chand Gupta:
A metric on the set of elliptic curves over F_{p}.
Appl. Math. Lett. 21(12): 1330-1332 (2008) |

2007 | ||

12 | EE | Pradeep Kumar Mishra, Vassil S. Dimitrov: A Graph Theoretic Analysis of Double Base Number Systems. INDOCRYPT 2007: 152-166 |

11 | EE | Pradeep Kumar Mishra, Vassil S. Dimitrov: Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation. ISC 2007: 390-406 |

10 | EE | Pradeep Kumar Mishra, Pinakpani Pal, Palash Sarkar: Towards Minimizing Memory Requirement for Implementation of Hyperelliptic Curve Cryptosystems. ISPEC 2007: 269-283 |

2006 | ||

9 | EE | 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 |

8 | EE | Pradeep Kumar Mishra: Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems (Extended Version). IEEE Trans. Computers 55(8): 1000-1010 (2006) |

2005 | ||

7 | EE | Vassil S. Dimitrov, Laurent Imbert, Pradeep Kumar Mishra: Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains. ASIACRYPT 2005: 59-78 |

6 | EE | Pradeep Kumar Mishra: Efficient Simultaneous Inversion in Parallel and Application to Point Multiplication in ECC. CISC 2005: 324-335 |

5 | EE | 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 |

2004 | ||

4 | EE | Palash Sarkar,
Pradeep Kumar Mishra,
Rana Barua:
New Table Look-Up Methods for Faster Frobenius Map Based Scalar Multiplication Over GF(p^{n}).
ACNS 2004: 479-493 |

3 | EE | Pradeep Kumar Mishra: Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems. CHES 2004: 328-342 |

2 | EE | 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 |

2003 | ||

1 | EE | Pradeep Kumar Mishra, Palash Sarkar: Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves. ASIACRYPT 2003: 93-110 |

1 | Rana Barua | [4] |

2 | Vassil S. Dimitrov | [7] [11] [12] |

3 | Kishan Chand Gupta | [9] [13] |

4 | Laurent Imbert | [7] |

5 | Tanja Lange | [5] |

6 | Pinakpani Pal | [9] [10] |

7 | Palash Sarkar | [1] [2] [4] [10] |