Sciweavers

3898 search results - page 231 / 780
» On the Bit Extraction Problem
Sort
View
DAGSTUHL
2007
15 years 4 months ago
How Fast can be Algebraic Attacks on Block Ciphers?
In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...
Nicolas Courtois
JSS
2008
68views more  JSS 2008»
15 years 3 months ago
An efficient iconic indexing strategy for image rotation and reflection in image databases
Spatial relationships are important issues for similarity-based retrieval in many image database applications. With the popularity of digital cameras and the related image process...
Wei-Horng Yeh, Ye-In Chang
RFIDSEC
2010
15 years 1 months ago
Optimal Security Limits of RFID Distance Bounding Protocols
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
Orhun Kara, Süleyman Kardas, Muhammed Ali Bin...
136
Voted
GLOBECOM
2010
IEEE
15 years 1 months ago
Automatic Gain Control for ADC-Limited Communication
As the date rates and bandwidths of communication systems scale up, the cost and power consumption of highprecision (e.g., 8-12 bits) analog-to-digital converters (ADCs) become pro...
Feifei Sun, Jaspreet Singh, Upamanyu Madhow
AMC
2007
93views more  AMC 2007»
15 years 3 months ago
Moving averages of solutions of ODEs
Moving averages of the solution of an initial value problem for a system of ordinary differential equations are used to extract the general behavior of the solution without follow...
Lawrence F. Shampine, Skip Thompson