Sciweavers

134 search results - page 8 / 27
» Binary Edwards Curves
Sort
View
PKC
2010
Springer
210views Cryptology» more  PKC 2010»
13 years 11 months ago
Efficient Arithmetic on Hessian Curves
This paper considers a generalized form for Hessian curves. The family of generalized Hessian curves covers more isomorphism classes of elliptic curves. Over a finite filed Fq, it ...
Reza Rezaeian Farashahi, Marc Joye
TOC
2008
75views more  TOC 2008»
13 years 9 months ago
A Quantum Algorithm for the Hamiltonian NAND Tree
Abstract: We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous time quantum walk with a running time propor...
Edward Farhi, Jeffrey Goldstone, Sam Gutmann
FSTTCS
2004
Springer
14 years 3 months ago
Approximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Mark de Berg, Micha Streppel
SACRYPT
1999
Springer
14 years 2 months ago
Elliptic Curve Pseudorandom Sequence Generators
In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF 2m. We call these sequences elliptic curve...
Guang Gong, Thomas A. Berson, Douglas R. Stinson
CHES
2010
Springer
132views Cryptology» more  CHES 2010»
13 years 11 months ago
Efficient Techniques for High-Speed Elliptic Curve Cryptography
In this paper, a thorough bottom-up optimization process (field, point and scalar arithmetic) is used to speed up the computation of elliptic curve point multiplication and report ...
Patrick Longa, Catherine H. Gebotys