No photo of Victor Shoup

Victor Shoup

Professor Of Computer Science

    1986 …2019

    Research output per year

    If you made any changes in Pure these will be visible here soon.

    Research Output

    Filter
    Article
    Article

    Algorithms for Exponentiation in Finite Fields

    Gao, S., Von Zur Gathen, J., Panario, D. & Shoup, V., Jun 2000, In : Journal of Symbolic Computation. 29, 6, p. 879-889 11 p.

    Research output: Contribution to journalArticle

    A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack

    Desmedt, Y., Gennaro, R., Kurosawa, K. & Shoup, V., Jan 2010, In : Journal of Cryptology. 23, 1, p. 91-120 30 p.

    Research output: Contribution to journalArticle

    A new polynomial factorization algorithm and its implementation

    Shoup, V., Oct 1995, In : Journal of Symbolic Computation. 20, 4, p. 363-397 35 p.

    Research output: Contribution to journalArticle

    Calculations on the S2 ground state of the lithium atom

    King, F. W. & Shoup, V., 1986, In : Physical Review A. 33, 5, p. 2940-2948 9 p.

    Research output: Contribution to journalArticle

    Computing Frobenius maps and factoring polynomials

    von zur Gathen, J. & Shoup, V., Sep 1992, In : Computational Complexity. 2, 3, p. 187-224 38 p.

    Research output: Contribution to journalArticle

    Constructing nonresidues in finite fields and the extended Riemann hypothesis

    Buchmann, J. & Shoup, V., Jul 1996, In : Mathematics of Computation. 65, 215, p. 1311-1326 16 p.

    Research output: Contribution to journalArticle

    Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack

    Cramer, R. & Shoup, V., Nov 2003, In : SIAM Journal on Computing. 33, 1, p. 167-226 60 p.

    Research output: Contribution to journalArticle

    Factoring polynomials using fewer random bits

    Bach, E. & Shoup, V., 1990, In : Journal of Symbolic Computation. 9, 3, p. 229-239 11 p.

    Research output: Contribution to journalArticle

    Fast construction of irreducible polynomials over finite fields

    Shoup, V., 1994, In : Journal of Symbolic Computation. 17, 5, p. 371-391 21 p.

    Research output: Contribution to journalArticle

    GNUC: A New Universal Composability Framework

    Hofheinz, D. & Shoup, V., Jul 12 2015, In : Journal of Cryptology. 28, 3, p. 423-508 86 p.

    Research output: Contribution to journalArticle

    Lower bounds for polynomial evaluation and interpolation problems

    Shoup, V. & Smolensky, R., 1996, In : Computational Complexity. 6, 4, p. 301-311 11 p.

    Research output: Contribution to journalArticle

    New algorithms for finding irreducible polynomials over finite fields

    Shoup, V., 1990, In : Mathematics of Computation. 54, p. 435-447

    Research output: Contribution to journalArticle

    OAEP Reconsidered

    Shoup, V., Sep 2002, In : Journal of Cryptology. 15, 4, p. 223-249 27 p.

    Research output: Contribution to journalArticle

    On the deterministic complexity of factoring polynomials over finite fields

    Shoup, V., Jan 10 1990, In : Information Processing Letters. 33, 5, p. 261-267 7 p.

    Research output: Contribution to journalArticle

    On the security of a practical identification

    Shoup, S. V., 1999, In : Journal of Cryptology. 12, 4, p. 247-260 14 p.

    Research output: Contribution to journalArticle

    On the security of a practical identification scheme

    Shoup, V., 1999, In : Journal of Cryptology. 12, 4, p. 247-260

    Research output: Contribution to journalArticle

    Optimistic fair exchange of digital signatures

    Asokan, N., Shoup, V. & Waidner, M., Apr 2000, In : IEEE Journal on Selected Areas in Communications. 18, 4, p. 593-610 18 p.

    Research output: Contribution to journalArticle

    Practical chosen ciphertext secure encryption from factoring

    Hofheinz, D., Kiltz, E. & Shoup, V., 2013, In : Journal of Cryptology. 26, 1, p. 102-118 17 p.

    Research output: Contribution to journalArticle

    Primality testing with fewer random bits

    Peralta, R. & Shoup, V., Dec 1993, In : Computational Complexity. 3, 4, p. 355-367 13 p.

    Research output: Contribution to journalArticle

    Random oracles in constantinople: Practical asynchronous Byzantine agreement using cryptography

    Cachin, C., Kursawe, K. & Shoup, V., Jul 2005, In : Journal of Cryptology. 18, 3, p. 219-246 28 p.

    Research output: Contribution to journalArticle

    Searching for primitive roots in finite fields

    Shoup, V., Jan 1992, In : Mathematics of Computation. 58, 197, p. 369-380 12 p.

    Research output: Contribution to journalArticle

    Open Access

    Securing threshold cryptosystems against chosen ciphertext attack

    Shoup, V. & Gennaro, R., 2002, In : Journal of Cryptology. 15, 2, p. 75-96

    Research output: Contribution to journalArticle

    Signature Schemes Based on the Strong RSA Assumption

    Cramer, R. & Shoup, V., Aug 1 2000, In : ACM Transactions on Information and System Security. 3, 3, p. 161-185 25 p.

    Research output: Contribution to journalArticle

    Smoothness and factoring polynomials over finite fields

    Shoup, V., Apr 12 1991, In : Information Processing Letters. 38, 1, p. 39-42 4 p.

    Research output: Contribution to journalArticle

    Subquadratic-time factoring of polynomials over finite fields

    Kaltofen, E. & Shoup, V., Jul 1998, In : Mathematics of Computation. 67, 223, p. 1179-1197 19 p.

    Research output: Contribution to journalArticle

    Open Access

    The twin diffie-hellman problem and applications

    Cash, D., Kiltz, E. & Shoup, V., Oct 2009, In : Journal of Cryptology. 22, 4, p. 470-504 35 p.

    Research output: Contribution to journalArticle