Searching for authors named "Ramarathnam Venkatesan" – sorted by Relevance.
-
Highly Parallel Cryptographic Attacks
- Highly Parallel Cryptographic Attacks Marcus Peinado ?1 and Ramarathnam Venkatesan 2 1
- Add To MetaCart
-
Hardness Computing Bits of Secret Keys in Diffie-Hellman and Related Schemes
- 08544 Ramarathnam Venkatesan venkie@(email omitted); Bellcore Room-1C341B, 445 South Street, Morristown NJ
- Add To MetaCart
-
The chain sum primitive and its applications to MACs and stream ciphers
- and Ramarathnam Venkatesan 2 1 Princeton University, mj@(email omitted); 2 Microsoft Research, Redmond, WA
- Cited by 4 (0 self) – Add To MetaCart
-
Categorial and Non-Categorial Languages
- -CATEGORIAL LANGUAGES Joyce Friedman Ramarathnam Venkatesan Computer Science Department Boston University 111 Cummington
- Cited by 1 (0 self) – Add To MetaCart
-
Random Cayley Digraphs and the Discrete Logarithm
- and Ramarathnam Venkatesan 2 1 Stanford University, Stanford, CA 94305, USA horwitz@(email omitted); 2 Microsoft
- Cited by 3 (1 self) – Add To MetaCart
-
Rounding in Lattices and Its Cryptographic Applications
- of Computer Science Princeton University Princeton, NJ 08544 Ramarathnam Venkatesan venkie
- Cited by 20 (0 self) – Add To MetaCart
-
A Graph Theoretic Approach to Software Watermarking
- A Graph Theoretic Approach to Software Watermarking Ramarathnam Venkatesan Microsoft Research
- Add To MetaCart
-
Breaking RSA May Be Easier Than Factoring
- Breaking RSA May Be Easier Than Factoring (Extended Abstract) Dan Boneh Ramarathnam Venkatesan
- Add To MetaCart
-
Cryptanalysis of RSA Using Algebraic and Lattice Methods
- and quality, as a dissertation for the degree of Doctor of Philosophy. Ramarathnam Venkatesan Approved
- Add To MetaCart
-
Constructing Elliptic Curves With a Given Number of Points Over a Finite Field
- Lauter, Ramarathnam Venkatesan November 13, 2001 Abstract. In using elliptic curves for cryptography, one
- Cited by 2 (0 self) – Add To MetaCart

