Sciweavers

6568 search results - page 141 / 1314
» Reducing the Complexity of Reductions
Sort
View
IDA
2009
Springer
15 years 11 months ago
Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework
Searching for interesting patterns in binary matrices plays an important role in data mining and, in particular, in formal concept analysis and related disciplines. Several algorit...
Petr Krajca, Vilém Vychodil
INDOCRYPT
2010
Springer
15 years 4 months ago
The Improbable Differential Attack: Cryptanalysis of Reduced Round CLEFIA
Abstract. In this paper we present a new statistical cryptanalytic technique that we call improbable differential cryptanalysis which uses a differential that is less probable when...
Cihangir Tezcan
CANS
2011
Springer
254views Cryptology» more  CANS 2011»
14 years 6 months ago
Algebraic Cryptanalysis of the Round-Reduced and Side Channel Analysis of the Full PRINTCipher-48
Abstract. In this paper we analyze the recently proposed light-weight block cipher PRINTCipher. Applying algebraic methods and SAT-solving we are able to break 8 rounds of PRINTCip...
Stanislav Bulygin, Johannes Buchmann
IEEEARES
2010
IEEE
16 years 1 months ago
Strategies for Reducing Risks of Inconsistencies in Access Control Policies
—Managing access control policies is a complex task. We argue that much of the complexity is unnecessary and mostly due to historical reasons. There are number of legacy policy s...
Bernard Stepien, Stan Matwin, Amy P. Felty
SCA
2007
15 years 9 months ago
Time-critical distributed contact for 6-DoF haptic rendering of adaptively sampled reduced deformable models
Real-time evaluation of distributed contact forces for rigid or deformable 3D objects is important for providing multi-sensory feedback in emerging real-time applications, such as...
Jernej Barbic, Doug L. James