A Computational Introduction to Number Theory and Algebra || Rings
- 作者Shoup, Victor
- 期第7期
- 文件大小358.46KB
- 发表时间2008
- DOI10.1017/cbo9780511814549.009
- 页码166-206
A COMPUTATIONAL INTRODUCTION TO NUMBER THEORY AND ALGEBRACAMBRIDGE UNIVERSITY PRESS · 2005
A Computational Introduction to Number Theory and Algebra || PreliminariesShoup, Victor · 2005
A Computational Introduction to Number Theory and Algebra || PrefaceShoup, Victor · 2008
A Computational Introduction to Number Theory and Algebra || PreliminariesShoup, Victor · 2008
A Computational Introduction to Number Theory and Algebra || RingsShoup, Victor · 2008
A Computational Introduction to Number Theory and Algebra || MatricesShoup, Victor · 2008
A Computational Introduction to Number Theory and Algebra || BibliographyShoup, Victor · 2008
Factoring polynomials using fewer random bitsEric Bach; Victor Shoup · 1990
Primality testing with fewer random bitsRené Peralta; Victor Shoup · Computational Complexity · 1993
OAEP ReconsideredVictor Shoup · Journal of Cryptology · 2002
Computing Frobenius maps and factoring polynomialsJoachim von zur Gathen; Victor Shoup · Computational Complexity · 1992
Smoothness and factoring polynomials over finite fieldsVictor Shoup · 1991
GNUC: A New Universal Composability FrameworkHofheinz, Dennis; Shoup, Victor · Journal of Cryptology · 2015
ground state of the lithium atomKing, Frederick W.; Shoup, Victor · Physical Review A · 1986
Searching for Primitive Roots in Finite FieldsVictor Shoup · Mathematics of Computation · 1992