140 search results - page 14 / 28 » String Quartets In Binary |
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
USENIX
2007
13 years 10 months ago
2007
In many environments, a computer system is severely constrained to the extent that the practical input mechanisms are merely binary switches. Requiring the user to remember a long...
ICEC
1994
13 years 9 months ago
1994
There are two types of GAs with difference of their representation of strings. They are the binary coded GA and the order-based GA. We've already proposed a new type of binar...
ICISC
2009
13 years 5 months ago
2009
We design a new (n, 1)-CPIR protocol BddCpir for -bit strings as a combination of a noncryptographic (BDD-based) data structure and a more basic cryptographic primitive (communicat...