Sciweavers

30 search results - page 5 / 6
» Primality Proving with Elliptic Curves
Sort
View
EUROPKI
2004
Springer
13 years 11 months ago
On the Use of Weber Polynomials in Elliptic Curve Cryptography
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...
Elisavet Konstantinou, Yannis C. Stamatiou, Christ...
CHES
2006
Springer
158views Cryptology» more  CHES 2006»
13 years 10 months ago
Hardware/Software Co-design of Elliptic Curve Cryptography on an 8051 Microcontroller
8-bit microcontrollers like the 8051 still hold a considerable share of the embedded systems market and dominate in the smart card industry. The performance of 8-bit microcontrolle...
Manuel Koschuch, Joachim Lechner, Andreas Weitzer,...
PROVSEC
2010
Springer
13 years 4 months ago
Identity Based Public Verifiable Signcryption Scheme
Abstract. Signcryption as a single cryptographic primitive offers both confidentiality and authentication simultaneously. Generally in signcryption schemes, the message is hidden a...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
CTRSA
2004
Springer
120views Cryptology» more  CTRSA 2004»
13 years 11 months ago
Identity Based Undeniable Signatures
Abstract. In this paper, we give a first example of identity based undeniable signature using pairings over elliptic curves. We extend to the identity based setting the security m...
Benoît Libert, Jean-Jacques Quisquater
TIT
2008
83views more  TIT 2008»
13 years 6 months ago
Hard Problems of Algebraic Geometry Codes
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
Qi Cheng