1099 search results - page 64 / 220 » String Transformation Learning |
ASIACRYPT
2009
Springer
14 years 4 months ago
2009
Springer
A universally composable (UC) blind signature functionality requres users to commit to the message to be blindly signed. It is thereby impossible to realize in the plain model. Th...
CSR
2009
Springer
14 years 4 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
RECONFIG
2008
IEEE
14 years 4 months ago
2008
IEEE
– We have implemented in FPGA recently published class of public key algorithms – MQQ, that are based on quasigroup string transformations. Our implementation achieves decrypti...
TCC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. A protocol compiler is described, that transforms any provably secure authenticated 2-party key establishment into a provably secure authenticated group key establishment...
ICMCS
2006
IEEE
14 years 4 months ago
2006
IEEE
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...