Results 1  10
of
460,452
A Fast Level Set Method for Propagating Interfaces
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1994
"... A method is introduced to decrease the computational labor of the standard level set method for propagating interfaces. The fast approach uses only points close to the curve at every time step. We describe this new algorithm and compare its efficiency and accuracy with the standard level set approac ..."
Abstract

Cited by 417 (28 self)
 Add to MetaCart
A method is introduced to decrease the computational labor of the standard level set method for propagating interfaces. The fast approach uses only points close to the curve at every time step. We describe this new algorithm and compare its efficiency and accuracy with the standard level set
Fast Key Exchange with Elliptic Curve Systems
, 1995
"... The DiffieHellman key exchange algorithm can be implemented using the group of points on an elliptic curve over the field F 2 n . A software version of this using n = 155 can be optimized to achieve computation rates that are significantly faster than nonelliptic curve versions with a similar leve ..."
Abstract

Cited by 107 (2 self)
 Add to MetaCart
The DiffieHellman key exchange algorithm can be implemented using the group of points on an elliptic curve over the field F 2 n . A software version of this using n = 155 can be optimized to achieve computation rates that are significantly faster than nonelliptic curve versions with a similar
POINT COMPRESSION FOR KOBLITZ ELLIPTIC CURVES
"... Abstract. Elliptic curves over finite fields have applications in public key cryptography. A Koblitz curve is an elliptic curve E over F2; the group E(F2n) has convenient features for efficient implementation of elliptic curve cryptography. Wiener and Zuccherato and Gallant, Lambert and Vanstone sho ..."
Abstract
 Add to MetaCart
Abstract. Elliptic curves over finite fields have applications in public key cryptography. A Koblitz curve is an elliptic curve E over F2; the group E(F2n) has convenient features for efficient implementation of elliptic curve cryptography. Wiener and Zuccherato and Gallant, Lambert and Vanstone
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
Fast Implementation of Elliptic Curve
 Proc. PKC 2000, LNCS 1751
, 2000
"... Elliptic curve cryptosystems have attracted much attention in recent years and one of major interests in ECC is to develop fast algorithms for elliptic curve arithmetic. In this paper we present various improvement techniques for field arithmetic in GF(p )(p a prime), in particular, fast fiel ..."
Abstract
 Add to MetaCart
Elliptic curve cryptosystems have attracted much attention in recent years and one of major interests in ECC is to develop fast algorithms for elliptic curve arithmetic. In this paper we present various improvement techniques for field arithmetic in GF(p )(p a prime), in particular, fast
Comparing elliptic curve cryptography and RSA on 8bit CPUs
 in Proc. of the Sixth Workshop on Crypto graphic Hardware and Embedded Systems (CHES’04
, 2004
"... Abstract. Strong publickey cryptography is often considered to be too computationally expensive for small devices if not accelerated by cryptographic hardware. We revisited this statement and implemented elliptic curve point multiplication for 160bit, 192bit, and 224bit NIST/SECG curves over GF ..."
Abstract

Cited by 182 (2 self)
 Add to MetaCart
Abstract. Strong publickey cryptography is often considered to be too computationally expensive for small devices if not accelerated by cryptographic hardware. We revisited this statement and implemented elliptic curve point multiplication for 160bit, 192bit, and 224bit NIST/SECG curves over
Elliptic Curve Point Counting
, 2009
"... The problem of determining the order of the group of rational points on an elliptic curve over a finite fieldthe point counting problemis of critical importance in applications such as primality proving and cryptography. For cryptographic applications, elliptic curve should be nonsupersingular, a ..."
Abstract
 Add to MetaCart
The problem of determining the order of the group of rational points on an elliptic curve over a finite fieldthe point counting problemis of critical importance in applications such as primality proving and cryptography. For cryptographic applications, elliptic curve should be non
Fast Implementation of Elliptic Curve Arithmetic in . . .
 Proc. PKC 2000, LNCS 1751
, 2000
"... . Elliptic curve cryptosystems have attracted much attention in recent years and one of major interests in ECC is to develop fast algorithms for eld/elliptic curve arithmetic. In this paper we present various improvement techniques for eld arithmetic in GF(p n )(p a prime), in particular, fast eld ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
. Elliptic curve cryptosystems have attracted much attention in recent years and one of major interests in ECC is to develop fast algorithms for eld/elliptic curve arithmetic. In this paper we present various improvement techniques for eld arithmetic in GF(p n )(p a prime), in particular, fast
Fast Point Multiplication on Elliptic Curves through Isogenies
, 2003
"... Elliptic curve cryptosystems are usually implemented over elds of characteristic two or over (large) prime elds. For large prime elds, projective coordinates are more suitable as they reduce the computational workload in a point multiplication. In this case, choosing for parameter a the value 3 ..."
Abstract
 Add to MetaCart
Elliptic curve cryptosystems are usually implemented over elds of characteristic two or over (large) prime elds. For large prime elds, projective coordinates are more suitable as they reduce the computational workload in a point multiplication. In this case, choosing for parameter a the value
Results 1  10
of
460,452