Sciweavers

1646 search results - page 44 / 330
» fast 2007
Sort
View
EUROCRYPT
2007
Springer
14 years 1 months ago
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
Motivated by the quest for reducing assumptions in security proofs in cryptography, this paper is concerned with designing efficient symmetric encryption and authentication schemes...
Ueli M. Maurer, Johan Sjödin
DAM
2007
77views more  DAM 2007»
13 years 10 months ago
Decompositions of graphs of functions and fast iterations of lookup tables
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
Boaz Tsaban
DAGSTUHL
1997
13 years 11 months ago
Simple, Fast, and Robust Ray Casting of Irregular Grids
In this paper we describe a simple and efficient ray casting engine that is suitable for the rapid exploration of irregular grids composed of tetrahedra cells, or other cell comp...
Paul Bunyk, Arie E. Kaufman, Cláudio T. Sil...
IJNSEC
2007
82views more  IJNSEC 2007»
13 years 9 months ago
On Software Implementation of Fast DDP-based Ciphers
Data-dependent (DD) permutations (DDP) are discussed as a cryptographic primitive for the design of fast hardware, firmware, and software encryption systems. DDP can be performed...
Nikolay A. Moldovyan, Peter A. Moldovyanu, Douglas...
SBBD
2000
168views Database» more  SBBD 2000»
13 years 11 months ago
Fast Feature Selection Using Fractal Dimension
Dimensionalitycurse and dimensionalityreduction are two issues that have retained highinterest for data mining, machine learning, multimedia indexing, and clustering. We present a...
Caetano Traina Jr., Agma J. M. Traina, Leejay Wu, ...