Sciweavers

59 search results - page 1 / 12
» Fast Computation on Encrypted Polynomials and Applications
Sort
View
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
12 years 4 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel
MASCOTS
2001
13 years 5 months ago
Performance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...
Zhi Li, John Higgins, Mark J. Clement
CRYPTO
1997
Springer
169views Cryptology» more  CRYPTO 1997»
13 years 8 months ago
Deniable Encryption
Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices and also the secret ...
Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostr...
PERCOM
2005
ACM
14 years 4 months ago
Performance and Energy Efficiency of Block Ciphers in Personal Digital Assistants
Encryption algorithms can be used to help secure wireless communications, but securing data also consumes resources. The goal of this research is to provide users or system develo...
Creighton T. R. Hager, Scott F. Midkiff, Jung Min ...