Sciweavers

128 search results - page 23 / 26
» Weak Verifiable Random Functions
Sort
View
74
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
The Inframetric Model for the Internet
—A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, man...
Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Vien...
ASIACRYPT
2000
Springer
15 years 2 months ago
Cryptanalysis of the TTM Cryptosystem
Abstract. In 1985 Fell and Diffie proposed constructing trapdoor functions with multivariate equations [11]. They used several sequentially solved stages. Another idea of building ...
Louis Goubin, Nicolas Courtois
BMCBI
2004
126views more  BMCBI 2004»
14 years 9 months ago
A probabilistic model for the evolution of RNA structure
Background: For the purposes of finding and aligning noncoding RNA gene- and cis-regulatory elements in multiple-genome datasets, it is useful to be able to derive multi-sequence ...
Ian Holmes
IACR
2011
135views more  IACR 2011»
13 years 9 months ago
Algebraic Complexity Reduction and Cryptanalysis of GOST
Abstract. GOST 28147-89 is a well-known block cipher and the official encryption standard of the Russian Federation. Its large key size of 256 bits at a particularly low implementa...
Nicolas Courtois
CRYPTO
2006
Springer
155views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
A Method for Making Password-Based Key Exchange Resilient to Server Compromise
This paper considers the problem of password-authenticated key exchange (PAKE) in a client-server setting, where the server authenticates using a stored password file, and it is de...
Craig Gentry, Philip D. MacKenzie, Zulfikar Ramzan