3898 search results - page 248 / 780 » On the Bit Extraction Problem |
149
Voted
DCC
1992
IEEE
15 years 7 months ago
1992
IEEE
Text compression algorithms are normally defined in terms of a source alphabet of 8-bit ASCII codes. We consider choosing to be an alphabet whose symbols are the words of Englis...
118
click to vote
SIGIR
1992
ACM
15 years 7 months ago
1992
ACM
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
111
click to vote
DAC
2010
ACM
15 years 7 months ago
2010
ACM
Understanding the flow of information is an important aspect in computer security. There has been a recent move towards tracking information in hardware and understanding the flow...
132
Voted
ASIACRYPT
2006
Springer
15 years 7 months ago
2006
Springer
We consider the problem of cheating in secret sharing schemes, cheating in which individuals submit forged shares in the secret reconstruction phase in an effort to make another pa...
141
Voted
CCS
2006
ACM
15 years 7 months ago
2006
ACM
Let us have an NLFSR with the feedback function g(x) and an LFSR with the generating polynomial f(x). The function g(x) is a Boolean function on the state of the NLFSR and the LFS...