Results 1  10
of
806
Efficient Algorithms for Elliptic Curve Cryptosystems
, 1997
"... Elliptic curves are the basis for a relative new class of publickey schemes. It is predicted that elliptic curves will replace many existing schemes in the near future. It is thus of great interest to develop algorithms which allow efficient implementations of elliptic curve crypto systems. This th ..."
Abstract

Cited by 73 (9 self)
 Add to MetaCart
Elliptic curves are the basis for a relative new class of publickey schemes. It is predicted that elliptic curves will replace many existing schemes in the near future. It is thus of great interest to develop algorithms which allow efficient implementations of elliptic curve crypto systems
Dickson Bases and Finite Fields
"... Finite fields have been used for many applications in electronic communications. In the case of extension fields, the nature of computation depends heavily on the choice of basis used to represent the extension over the base field. The most common choices of basis are polynomial bases although optim ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Finite fields have been used for many applications in electronic communications. In the case of extension fields, the nature of computation depends heavily on the choice of basis used to represent the extension over the base field. The most common choices of basis are polynomial bases although
Elliptic curve cryptosystems on reconfigurable hardware
 MASTER’S THESIS, WORCESTER POLYTECHNIC INST
, 1998
"... Security issues will play an important role in the majority of communication and computer networks of the future. As the Internet becomes more and more accessible to the public, security measures will have to be strengthened. Elliptic curve cryptosystems allow for shorter operand lengths than other ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
Security issues will play an important role in the majority of communication and computer networks of the future. As the Internet becomes more and more accessible to the public, security measures will have to be strengthened. Elliptic curve cryptosystems allow for shorter operand lengths than other
Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
, 2013
"... We study Dickson bases for binary field representation. Such a representation seems interesting when no optimal normal basis exists for the field. We express the product of two field elements as Toeplitz or Hankel matrixvector products. This provides a parallel multiplier which is subquadratic in s ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study Dickson bases for binary field representation. Such a representation seems interesting when no optimal normal basis exists for the field. We express the product of two field elements as Toeplitz or Hankel matrixvector products. This provides a parallel multiplier which is subquadratic
Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
"... We study Dickson bases for binary field representation. Such representation seems interesting when no optimal normal basis exists for the field. We express the product of two elements as Toeplitz or Hankel matrix vector product. This provides a parallel multiplier which is subquadratic in space and ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We study Dickson bases for binary field representation. Such representation seems interesting when no optimal normal basis exists for the field. We express the product of two elements as Toeplitz or Hankel matrix vector product. This provides a parallel multiplier which is subquadratic in space
An Efficient Multiplier/Divider Design for Elliptic Curve Cryptosystem over GF(2^m)
, 2009
"... Using the concept of reciprocal polynomial, this paper shows that a field multiplication over GF(2 m) can be implemented by extended Stein’s algorithm, one of the algorithms used to accomplish division. In this way, a field multiplier can be efficiently embedded into a divider with very little hardw ..."
Abstract
 Add to MetaCart
Using the concept of reciprocal polynomial, this paper shows that a field multiplication over GF(2 m) can be implemented by extended Stein’s algorithm, one of the algorithms used to accomplish division. In this way, a field multiplier can be efficiently embedded into a divider with very little
Analysis of Lightweight Stream Ciphers
 PHD THESIS
, 2008
"... Stream ciphers are fast cryptographic primitives to provide confidentiality of electronically transmitted data. They can be very suitable in environments with restricted resources, such as mobile devices or embedded systems. Practical examples are cell phones, RFID transponders, smart cards or devic ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
or devices in sensor networks. Besides efficiency, security is the most important property of a stream cipher. In this thesis, we address cryptanalysis of
modern lightweight stream ciphers. We derive and improve cryptanalytic methods for different building blocks and present dedicated attacks on specific
Parallel Multipliers for Modular Arithmetic
 PH.D. THESIS
, 2005
"... Modular multiplication is a core operation in virtually all publickey cryptosystems in use today. In this research, parallel, highspeed designs for modular multiplication are presented. These high speed designs take advantage of the transistor bounty provided by Moore's law and the continuous ..."
Abstract
 Add to MetaCart
Modular multiplication is a core operation in virtually all publickey cryptosystems in use today. In this research, parallel, highspeed designs for modular multiplication are presented. These high speed designs take advantage of the transistor bounty provided by Moore's law
Results 1  10
of
806