20 search results - page 2 / 4 » Elliptic Curves with the Montgomery-Form and Their Cryptogra... |
DCC
2007
IEEE
14 years 5 months ago
2007
IEEE
Let p be a prime and let E(IFp) be an elliptic curve defined over the finite field IFp of p elements. For a given point G E(IFp) the linear congruential genarator on elliptic curv...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
EUROPKI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In many cryptographic applications it is necessary to generate elliptic curves (ECs) with certain security properties. These curves are commonly constructed using the Com...
FPL
2008
Springer
13 years 7 months ago
2008
Springer
Cryptanalysis of symmetric and asymmetric ciphers is a challenging task due to the enormous amount of involved computations. To tackle this computational complexity, usually the e...
FC
2005
Springer
13 years 11 months ago
2005
Springer
In this paper, we formulate the concept of policy-based cryptography which makes it possible to perform policy enforcement in large-scale open environments like the Internet, with ...