Sciweavers

32 search results - page 6 / 7
» Arithmetic Operators for Pairing-Based Cryptography
Sort
View
TEC
2008
93views more  TEC 2008»
13 years 5 months ago
An Artificial Immune System Heuristic for Generating Short Addition Chains
This paper deals with the optimal computation of finite field exponentiation, which is a well-studied problem with many important applications in the areas of error-correcting code...
Nareli Cruz Cortés, Francisco Rodríg...
CHES
2003
Springer
119views Cryptology» more  CHES 2003»
13 years 11 months ago
Faster Double-Size Modular Multiplication from Euclidean Multipliers
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
Benoît Chevallier-Mames, Marc Joye, Pascal P...
CASES
2003
ACM
13 years 11 months ago
Encryption overhead in embedded systems and sensor network nodes: modeling and analysis
Recent research in sensor networks has raised issues of security for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices...
Ramnath Venugopalan, Prasanth Ganesan, Pushkin Ped...
WSNA
2003
ACM
13 years 11 months ago
Analyzing and modeling encryption overhead for sensor network nodes
Recent research in sensor networks has raised security issues for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices in...
Prasanth Ganesan, Ramnath Venugopalan, Pushkin Ped...
JUCS
2010
124views more  JUCS 2010»
13 years 4 months ago
Performance Optimizations for DAA Signatures on Java enabled Platforms
: With the spreading of embedded and mobile devices, public-key cryptography has become an important feature for securing communication and protecting personal data. However, the c...
Kurt Dietrich, Franz Röck