Improving the arithmetic of elliptic curves in the Jacobi model

Authors:
Sylvain Duquesne
Affiliations:
I3M (UMR CNRS 5149) and LIRMM (UMR CNRS 5506), Université Montpellier II, CC 051, Place Eugène Bataillon, 34095 Montpellier Cedex 5, France
Venue:
Information Processing Letters
Year:
2007

Citing 4
Cited 7

Sequences of numbers generated by addition in formal groups and new primality and factorization tests

Advances in Applied Mathematics
Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems

CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
The Jacobi model of an elliptic curve and side-channel analysis

AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Fast point multiplication on elliptic curves through isogenies

AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes

Jacobi Quartic Curves Revisited

ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Elliptic Curve Scalar Multiplication Combining Yao's Algorithm and Double Bases

CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
New formulae for efficient elliptic curve arithmetic

INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Optimizing double-base elliptic-curve single-scalar multiplication

INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Inverted edwards coordinates

AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Twisted Edwards curves

AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Faster group operations on elliptic curves

AISC '09 Proceedings of the Seventh Australasian Conference on Information Security - Volume 98

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this Letter, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D have an induced subdigraph on k vertices with property P? We completely ...