237 search results - page 40 / 48 » MapReduce for Integer Factorization |
CANS
2011
Springer
12 years 11 months ago
2011
Springer
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
SIAMCOMP
1998
13 years 10 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
STOC
2009
ACM
14 years 11 months ago
2009
ACM
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
EUROCRYPT
2009
Springer
14 years 11 months ago
2009
Springer
At the RFID Security Workshop 2007, Adi Shamir presented a new challenge-response protocol well suited for RFIDs, although based on the Rabin public-key cryptosystem. This protocol...
FLOPS
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...