177 search results - page 12 / 36 » Overdetermined Elliptic Systems |
DATE
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract--Hardware/Software codesign of Elliptic Curve Cryptography has been extensively studied in recent years. However, most of these designs have focused on the computational a...
AMC
2007
13 years 7 months ago
2007
This paper deals with an extension of one-dimensional Clenshaw–Curtis quadrature rule to Rd ; d P 2 on a convex domain. As one of its applications, we apply this quadrature rule...
IJNSEC
2006
13 years 7 months ago
2006
Finding a shorter addition/subtraction-chain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplica...
MYCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = k i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤ c + o(1) ¡ log n log log n ....
CHES
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. In this paper we show how using a representation of an elliptic curve as the intersection of two quadrics in P3 can provide a defence against Simple and Differental Powe...