Sciweavers

8810 search results - page 1574 / 1762
» Open. Closed. Open
Sort
View
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
15 years 12 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
EDBTW
2004
Springer
15 years 12 months ago
P2PR-Tree: An R-Tree-Based Spatial Index for Peer-to-Peer Environments
Abstract. The unprecedented growth and increased importance of geographically distributed spatial data has created a strong need for efficient sharing of such data. Interestingly, ...
Anirban Mondal, Yi Lifu, Masaru Kitsuregawa
EGH
2004
Springer
15 years 12 months ago
A programmable vertex shader with fixed-point SIMD datapath for low power wireless applications
The real time 3D graphics becomes one of the attractive applications for 3G wireless terminals although their battery lifetime and memory bandwidth limit the system resources for ...
Ju-Ho Sohn, Ramchan Woo, Hoi-Jun Yoo
EMISA
2004
Springer
15 years 12 months ago
eSarine - A Struts-based Webshop for Small and Medium-sized Enterprises
: Electronic commerce becomes an important competitive advantage for small and medium-sized enterprises. Those enterprises therefore need a tool to easily exhibit and sell their pr...
Nicolas Werro, Henrik Stormer, Daniel Frauchiger, ...
EUROCRYPT
2004
Springer
15 years 12 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
« Prev « First page 1574 / 1762 Last » Next »