1274 search results - page 69 / 255 » New Proofs for |
RSA
2000
13 years 7 months ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
DM
1998
13 years 7 months ago
1998
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
JCT
2010
13 years 6 months ago
2010
We prove a vector space analog of a version of the Kruskal-Katona theorem due to Lov´asz. We apply this result to extend Frankl’s theorem on r-wise intersecting families to vec...
POPL
2006
ACM
14 years 8 months ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
At Crypto ’06, Bellare presented new security proofs for HMAC and NMAC, under the assumption that the underlying compression function is a pseudo-random function family. Converse...