Sciweavers

32 search results - page 3 / 7
» Arithmetic Operators for Pairing-Based Cryptography
Sort
View
ISDA
2006
IEEE
15 years 3 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
FPL
2008
Springer
131views Hardware» more  FPL 2008»
14 years 11 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...
ARITH
1997
IEEE
15 years 1 months ago
Theory and applications for a double-base number system
In this paper we present a rigorous theoretical analysis of the main properties of a double base number system, using bases 2 and 3; in particular we emphasize the sparseness of t...
Vassil S. Dimitrov, Graham A. Jullien, William C. ...
ARITH
2001
IEEE
15 years 1 months ago
Computer Arithmetic-A Processor Architect's Perspective
The Instruction Set Architecture (ISA) of a programmable processor is the native languageof the machine. It defines the set of operations and resourcesthat are optimized for that ...
Ruby B. Lee
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
15 years 10 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai