Results 1  10
of
49
An FPGABased CoProcessor for Elliptic Curve Cryptography
 5TH IASTED ASIAN CONFERENCE ON COMMUNICATION SYSTEMS AND NETWORKS (ASIACSN 2008)
, 2009
"... This paper describes an FPGA based hardware accelerator for elliptic curve cryptography. This accelerator performs binary polynomial basis operations in Galois Field GF(2^m) using a microcoded structure. Microcode instructions support basic Galois Field operations regardless of encryption algorithms ..."
Abstract
 Add to MetaCart
This paper describes an FPGA based hardware accelerator for elliptic curve cryptography. This accelerator performs binary polynomial basis operations in Galois Field GF(2^m) using a microcoded structure. Microcode instructions support basic Galois Field operations regardless of encryption
PUBLICKEY CRYPTOSYSTEM BASED ON ISOGENIES
"... Abstract. A new general mathematical problem, suitable for publickey cryptosystems, is proposed: morphism computation in a category of Abelian groups. In connection with elliptic curves over finite fields, the problem becomes the following: compute an isogeny (an algebraic homomorphism) between the ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
and consideration of cryptosystem parameters selection. A demonstrative example of encryption is included as well. publickey cryptography, elliptic curve cryptosystem, cryptosystem on isogenies of elliptic curves, isogeny star, isogeny cycle, quantum computer 1
Evaluating large degree isogenies and applications to pairing based cryptography
"... Abstract. We present a new method to evaluate large degree isogenies between elliptic curves over finite fields. Previous approaches all have exponential running time in the logarithm of the degree. If the endomorphism ring of the elliptic curve is ‘small ’ we can do much better, and we present an a ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. We present a new method to evaluate large degree isogenies between elliptic curves over finite fields. Previous approaches all have exponential running time in the logarithm of the degree. If the endomorphism ring of the elliptic curve is ‘small ’ we can do much better, and we present
Tradeoff Analysis of FPGA Based Elliptic Curve Cryptosystems
 In Proceedings of The IEEE International Symposium on Circuits and Systems (ISCAS
"... FPGAs are an attractive platform for elliptic curve cryptography hardware. Since field multiplication is the most critical operation in elliptic curve cryptography, we have studied how efficient several field multipliers can be mapped to lookup table based FPGAs. Furthermore we have compared differ ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
FPGAs are an attractive platform for elliptic curve cryptography hardware. Since field multiplication is the most critical operation in elliptic curve cryptography, we have studied how efficient several field multipliers can be mapped to lookup table based FPGAs. Furthermore we have compared
FPGA IMPLEMENTATIONS OF HIGH SPEED ELLIPTIC CURVE CRYPTOGRAPHY: A SURVEY
"... Abstract:An explosive acceptance of Elliptic Curve Cryptography (ECC) has been attained in the industry and academics. Elliptic Curve cryptography is an approach to publickey cryptography based on the algebraic structure of elliptic curves over finite fields. The ECC is advantageous due to the prov ..."
Abstract
 Add to MetaCart
Abstract:An explosive acceptance of Elliptic Curve Cryptography (ECC) has been attained in the industry and academics. Elliptic Curve cryptography is an approach to publickey cryptography based on the algebraic structure of elliptic curves over finite fields. The ECC is advantageous due
An FPGA Implementation of Elliptic Curve Cryptography for Future Secure Web Transaction
"... Elliptic curve cryptography (ECC) is an alternative to traditional techniques for public key cryptography. It offers smaller key size without sacrificing security level. In a typical elliptic curve cryptosystem, elliptic curve point multiplication is the most computationally expensive component. So ..."
Abstract
 Add to MetaCart
Elliptic curve cryptography (ECC) is an alternative to traditional techniques for public key cryptography. It offers smaller key size without sacrificing security level. In a typical elliptic curve cryptosystem, elliptic curve point multiplication is the most computationally expensive component. So
A Random Number Generator Based on Isogenies Operations
"... Abstract: A random number generator based on the operation of isogenies between elliptic curves over finite fields Fp is proposed. By using the proposed generator together with the isogeny cryptography algorithm, which is against the attack of quantum computer, we can save hardware and software comp ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: A random number generator based on the operation of isogenies between elliptic curves over finite fields Fp is proposed. By using the proposed generator together with the isogeny cryptography algorithm, which is against the attack of quantum computer, we can save hardware and software
Performance Analysis of Elliptic Curve Cryptography on Reconfigurable Hardware
"... This paper presents an efficient FPGA implementation approach of the elliptic curve cryptography. There are many drawbacks in current encryption algorithms (RSA; AES) in respect of security, power & resources at realtime performance. The Elliptic Curve Cryptography (ECC) is evolving as an impor ..."
Abstract
 Add to MetaCart
This paper presents an efficient FPGA implementation approach of the elliptic curve cryptography. There are many drawbacks in current encryption algorithms (RSA; AES) in respect of security, power & resources at realtime performance. The Elliptic Curve Cryptography (ECC) is evolving
Expander graphs based on GRH with an application to elliptic curve cryptography
, 2008
"... We present a construction of expander graphs obtained from Cayley graphs of narrow ray class groups, whose eigenvalue bounds follow from the Generalized Riemann Hypothesis. Our result implies that the Cayley graph of (Z/qZ) ∗ with respect to small prime generators is an expander. As another applica ..."
Abstract
 Add to MetaCart
application, we show that the graph of small prime degree isogenies between ordinary elliptic curves achieves nonnegligible eigenvalue separation, and explain the relationship between the expansion properties of these graphs and the security of the elliptic curve discrete logarithm problem.
An EndtoEnd Systems Approach to Elliptic Curve Cryptography
 In Cryptographic Hardware and Embedded Systems (CHES
, 2002
"... Since its proposal by Victor Miller [17] and Neal Koblitz [15] in the mid 1980s, Elliptic Curve Cryptography (ECC) has evolved into a mature publickey cryptosystem. Offering the smallest key size and the highest strength per bit, its computational efficiency can benefit both client devices and serv ..."
Abstract

Cited by 32 (4 self)
 Add to MetaCart
Since its proposal by Victor Miller [17] and Neal Koblitz [15] in the mid 1980s, Elliptic Curve Cryptography (ECC) has evolved into a mature publickey cryptosystem. Offering the smallest key size and the highest strength per bit, its computational efficiency can benefit both client devices
Results 1  10
of
49