Sciweavers

534 search results - page 10 / 107
» One more bit is enough
Sort
View
FCT
1999
Springer
14 years 5 days ago
Iterative Arrays with a Wee Bit Alternation
Abstract. An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fe...
Thomas Buchholz, Andreas Klein, Martin Kutrib
CSSE
2008
IEEE
13 years 9 months ago
Image Retrieval Based on Bit-Plane Distribution Entropy
Based on the analysis of color histogram for image retrieval, a new descriptor, bit-plane distribution entropy (BPDE), is proposed in this paper. The image is firstly divided into ...
Zhao Shan, Wang Hai-tao
IACR
2011
85views more  IACR 2011»
12 years 7 months ago
Some Instant- and Practical-Time Related-Key Attacks on KTANTAN32/48/64
The hardware-attractive block cipher family KTANTAN was studied by Bogdanov and Rechberger who identified flaws in the key schedule and gave a meet-in-the-middle attack. We revis...
Martin Ågren
PERCOM
2009
ACM
14 years 2 months ago
BitHoc: A content sharing application for Wireless Ad hoc Networks
—As a result of the wide spread of new efficient mobile communication devices, users are more and more willing to find on these devices (PDAs, Smartphones, etc) applications si...
Amir Krifa, Mohamed Karim Sbai, Chadi Barakat, Thi...
CCS
2007
ACM
14 years 2 months ago
How much anonymity does network latency leak?
Low-latency anonymity systems such as Tor, AN.ON, Crowds, and Anonymizer.com aim to provide anonymous connections that are both untraceable by “local” adversaries who control ...
Nicholas Hopper, Eugene Y. Vasserman, Eric Chan-Ti...