Pradeep Kumar Mishra

International Association for Cryptologic Research

Pradeep Kumar Mishra Search web for home page

	year	title	booktitle	pages
1	2008	Fast Multiple Point Multiplication on Elliptic Curves over Prime and Binary Fields using the Double-Base Number System	eprint	online
2	2007	Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation	eprint	online
3	2006	Towards Minimizing Memory Requirement for Implementation of Hyperelliptic Curve Crytosystems	eprint	online
4	2005	A Metric on the Set of Elliptic Curves over ${\mathbf F}_p$	eprint	online
5	2005	Fast Elliptic Curve Point Multiplication using Double-Base Chains	eprint	online
6	2005	Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains	asiacrypt	online
7	2004	Scalar Multiplication in Elliptic Curve Cryptosystems: Pipelining with Pre-computations	eprint	online
8	2004	Application of Montgomery's Trick to Scalar Multiplication for Elliptic and Hyperelliptic Curves Using a Fixed Base Point	pkc	online
9	2004	Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems	ches	328-342
10	2003	Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves	eprint	online
11	2003	Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves	asiacrypt	online
12	2003	Inversion of Several Field Elements: A New Parallel Algorithm	eprint	online