Sciweavers

346 search results - page 22 / 70
» The Secret Santa Problem
Sort
View
DLOG
2004
13 years 11 months ago
On Subsumption and Instance Problem in ELH w.r.t. General TBoxes
Recently, it was shown for the DL EL that subsumption and instance problem w.r.t. cyclic terminologies can be decided in polynomial time. In this paper, we show that both problems...
Sebastian Brandt
COMPSAC
2004
IEEE
14 years 1 months ago
A Novel Key Management Scheme for Dynamic Access Control in a User Hierarchy
Considering the solution of dynamic access problems in a user hierarchy, a novel scheme based on one-way hash function is proposed to manage the cryptographic keys in the paper. T...
Tzer-Shyong Chen, Yu-Fang Chung, Chang-Sin Tian
IPPS
2007
IEEE
14 years 4 months ago
A Cryptographic Coarse Grain Reconfigurable Architecture Robust Against DPA
This work addresses the problem of information leakage of cryptographic devices, by using the reconfiguration technique allied to an RNS based arithmetic. The information leaked b...
Daniel Mesquita, Benoît Badrignans, Lionel T...
INDOCRYPT
2003
Springer
14 years 3 months ago
Analysis of Non-fortuitous Predictive States of the RC4 Keystream Generator
The RC4 stream cipher is the most widely used software based stream cipher. It is based on a secret internal state of N = 256 bytes and two pointers. This paper proposes an efficie...
Souradyuti Paul, Bart Preneel
FC
1999
Springer
97views Cryptology» more  FC 1999»
14 years 2 months ago
Playing "Hide and Seek" with Stored Keys
In this paper we consider the problem of efficiently locating cryptographic keys hidden in gigabytes of data, such as the complete file system of a typical PC. We describe efficie...
Adi Shamir, Nicko van Someren