Searching for authors named "Victor Shoup" – sorted by Relevance.
66 documents found, showing 1 through 10.
Next 10 →
-
Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields
- …Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields Victor…
- Cited by 21 (0 self) – Add To MetaCart
-
A composition theorem for universal one-way hash functions
- …A Composition Theorem for Universal One-Way Hash Functions Victor Shoup IBM Zurich Research Lab…
- Cited by 31 (4 self) – Add To MetaCart
-
A Fast Deterministic Algorithm for Factoring Polynomials over Finite Fields of Small Characteristic
- … Victor Shoup Computer Sciences Department University of Toronto Toronto, Ontario M5S 1A4 Abstract We…
- Cited by 12 (2 self) – Add To MetaCart
-
OAEP Reconsidered (Extended Abstract
- …OAEP Reconsidered (Extended Abstract) Victor Shoup IBM Zurich Research Lab, Säumerstr. 4, 8803…
- Cited by 1 (0 self) – Add To MetaCart
-
Removing Randomness From Computational Number Theory
- …REMOVING RANDOMNESS FROM COMPUTATIONAL NUMBER THEORY by VICTOR SHOUP A thesis submitted in partial…
- Cited by 2 (1 self) – Add To MetaCart
-
Factoring Polynomials over Finite Fields: Asymptotic Complexity vs. Reality
- …Factoring Polynomials over Finite Fields: Asymptotic Complexity vs. Reality Victor Shoup Dept…
- Cited by 4 (1 self) – Add To MetaCart
-
On Fast and Provably Secure Message Authentication Based on Universal Hashing
- …On Fast and Provably Secure Message Authentication Based on Universal Hashing Victor Shoup…
- Cited by 49 (0 self) – Add To MetaCart
-
Why Chosen Ciphertext Security Matters
- … Ciphertext Security Matters Victor Shoup IBM Research Division Zurich Research Laboratory 8803 Rüschlikon…
- Cited by 26 (2 self) – Add To MetaCart
-
On the Security of a Practical Identification Scheme
- …On the Security of a Practical Identification Scheme Victor Shoup Bellcore, 445 South St…
- Cited by 14 (0 self) – Add To MetaCart
-
On the Deterministic Complexity of Factoring Polynomials over Finite Fields
- …On the Deterministic Complexity of Factoring Polynomials over Finite Fields Victor Shoup Computer…
- Cited by 16 (4 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
