Sciweavers

208 search results - page 26 / 42
» Arithmetic Operations in the Polynomial Modular Number Syste...
Sort
View
EUROCRYPT
1999
Springer
13 years 12 months ago
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
Pascal Paillier
ASAP
2007
IEEE
107views Hardware» more  ASAP 2007»
14 years 2 months ago
A Hardware-Oriented Method for Evaluating Complex Polynomials
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
Milos D. Ercegovac, Jean-Michel Muller
CW
2005
IEEE
14 years 1 months ago
A Capability-Based Transparent Cryptographic File System
Data on the file system in mobile internetworked working environments are exposed data to a number of threats ranging from physical theft of storage devices to industrial espiona...
Frank Graf, Stephen D. Wolthusen
CTRSA
2004
Springer
114views Cryptology» more  CTRSA 2004»
14 years 1 months ago
Flexible Hardware Design for RSA and Elliptic Curve Cryptosystems
This paper presents a scalable hardware implementation of both commonly used public key cryptosystems, RSA and Elliptic Curve Cryptosystem (ECC) on the same platform. The introduce...
Lejla Batina, Geeke Bruin-Muurling, Siddika Berna ...
ASAP
2007
IEEE
93views Hardware» more  ASAP 2007»
14 years 2 months ago
LNS Subtraction Using Novel Cotransformation and/or Interpolation
The Logarithmic Number System (LNS) makes multiplication, division and powering easy, but subtraction is expensive. Cotransformation converts the difficult operation of logarithm...
Panagiotis D. Vouzis, Sylvain Collange, Mark G. Ar...