Sciweavers

202 search results - page 2 / 41
» Hardware Factorization Based on Elliptic Curve Method
Sort
View
ISCAS
2002
IEEE
112views Hardware» more  ISCAS 2002»
13 years 9 months ago
Tradeoff analysis of FPGA based elliptic curve cryptography
FPGAs are an attractive platform for elliptic curve cryptography hardware. Since field multiplication is the most critical operation in elliptic curve cryptography, we have studi...
Marcus Bednara, M. Daldrup, Jürgen Teich, Joa...
FPL
2008
Springer
131views Hardware» more  FPL 2008»
13 years 6 months ago
Enhancing COPACOBANA for advanced applications in cryptography and cryptanalysis
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...
Tim Güneysu, Christof Paar, Gerd Pfeiffer, Ma...
CARDIS
2000
Springer
124views Hardware» more  CARDIS 2000»
13 years 9 months ago
Elliptic Curve Cryptography on Smart Cards without Coprocessors
Abstract This contribution describes how an elliptic curve cryptosystem can be implemented on very low cost microprocessors with reasonable performance. We focus in this paper on t...
Adam D. Woodbury, Daniel V. Bailey, Christof Paar
AMC
2005
124views more  AMC 2005»
13 years 4 months ago
An efficient undeniable group-oriented signature scheme
Three main methods with favorable security and efficiency can be considered in the design of cryptosystems. These methods are integer factorization systems (of which RSA is the be...
Tzer-Shyong Chen, Jen-Yan Huang, Tzer-Long Chen
SACRYPT
2009
Springer
176views Cryptology» more  SACRYPT 2009»
13 years 11 months ago
Optimization Strategies for Hardware-Based Cofactorization
Abstract. We use the specific structure of the inputs to the cofactorization step in the general number field sieve (GNFS) in order to optimize the runtime for the cofactorizatio...
Daniel Loebenberger, Jens Putzka