Sciweavers

90 search results - page 10 / 18
» Fast implementations of RSA cryptography
Sort
View
ASAP
2004
IEEE
141views Hardware» more  ASAP 2004»
13 years 11 months ago
Evaluating Instruction Set Extensions for Fast Arithmetic on Binary Finite Fields
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
A. Murat Fiskiran, Ruby B. Lee
ISJGP
2010
13 years 5 months ago
On the Hardware Implementation Cost of Crypto-Processors Architectures
A variety of modern technologies such as networks, Internet, and electronic services demand private and secure communications for a great number of everyday transactions. Security ...
Nicolas Sklavos
PKC
2007
Springer
135views Cryptology» more  PKC 2007»
14 years 1 months ago
A Direct Anonymous Attestation Scheme for Embedded Devices
Abstract. Direct anonymous attestation (DAA) is an anonymous authentication scheme adopted by the Trusted Computing Group in its specifications for trusted computing platforms. Th...
He Ge, Stephen R. Tate
IJNSEC
2010
146views more  IJNSEC 2010»
13 years 2 months ago
A Novel Digital Envelope Approach for A Secure E-Commerce Channel
Data privacy and integrity will be the crucial and significant factors in recent times for trade which will be transacted over the Internet through e-commerce and mcommerce channe...
Ramachandran Ganesan, Mohan Gobi, Kanniappan Vivek...
TC
2010
13 years 2 months ago
Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
Miroslav Knezevic, Frederik Vercauteren, Ingrid Ve...