21 search results - page 3 / 5 » Solving Discrete Logarithms from Partial Knowledge of the Ke... |
ANLP
1992
13 years 11 months ago
1992
While complete understanding of arbitrary input text remains in the future, it is currently possible to construct natural language processing systems that provide a partial unders...
ISW
2010
Springer
13 years 7 months ago
2010
Springer
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
EUROCRYPT
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
EUROCRYPT
1998
Springer
14 years 2 months ago
1998
Springer
We introduce a new cryptosystem with trapdoor decryption based on the di culty of computing discrete logarithms in the class group of the non-maximal imaginary quadratic order O q ...
CVPR
2012
IEEE
12 years 7 days ago
2012
IEEE
In this paper, we propose a general framework for approximating differential operator directly on point clouds and use it for geometric understanding on them. The discrete approxi...