Sciweavers

209 search results - page 21 / 42
» Supersingular Curves in Cryptography
Sort
View
ISDA
2006
IEEE
14 years 1 months ago
Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis
- Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation p...
Youbo Wang, Zhiguang Tian, Xinyan Bi, Zhendong Niu
DATE
2009
IEEE
91views Hardware» more  DATE 2009»
13 years 11 months ago
Optimizing the HW/SW boundary of an ECC SoC design using control hierarchy and distributed storage
Abstract--Hardware/Software codesign of Elliptic Curve Cryptography has been extensively studied in recent years. However, most of these designs have focused on the computational a...
Xu Guo, Patrick Schaumont
ARC
2006
Springer
154views Hardware» more  ARC 2006»
13 years 11 months ago
Reconfigurable Modular Arithmetic Logic Unit for High-Performance Public-Key Cryptosystems
This paper presents a reconfigurable hardware architecture for Public-key cryptosystems. By changing the connections of coarse grain Carry-Save Adders (CSAs), the datapath provides...
Kazuo Sakiyama, Nele Mentens, Lejla Batina, Bart P...
FC
2005
Springer
119views Cryptology» more  FC 2005»
14 years 1 months ago
Policy-Based Cryptography and Applications
In this paper, we formulate the concept of policy-based cryptography which makes it possible to perform policy enforcement in large-scale open environments like the Internet, with ...
Walid Bagga, Refik Molva
ANTS
2006
Springer
101views Algorithms» more  ANTS 2006»
13 years 11 months ago
High Security Pairing-Based Cryptography Revisited
The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We ...
Robert Granger, Dan Page, Nigel P. Smart