Repla e this le with prent sma ro.sty for your meeting, or with ent sma ro.sty for your meeting. Both an be found at the ENTCS Ma ro Home Page. A logi al uniform boundedness prin iple for abstra t metri and hyperboli

Source URL: www.mathematik.tu-darmstadt.de

• Orthogonal polynomials
• Polynomials

arXiv:1605.08065v1 [cs.CR] 25 MayCryptographic applications of capacity theory: On the optimality of Coppersmith’s method for univariate polynomials Ted Chinburg

Source URL: arxiv.org

J. Algebra–577. INTERPOLATION by INTEGER-VALUED POLYNOMIALS Sophie Frisch

Source URL: blah.math.tu-graz.ac.at

SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT∗ May 8, 2008 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by polynomial equations and

Source URL: homepages.cwi.nl

SUPERSINGULAR j-INVARIANTS, HYPERGEOMETRIC SERIES, AND ATKIN’S ORTHOGONAL POLYNOMIALS M. Kaneko and D. Zagier §1. Introduction. An elliptic curve E over a field K of characteristic p > 0 is called supersingular

Source URL: people.mpim-bonn.mpg.de

On polynomial systems arising from a Weil descent Based on joint works with JC Faug`ere, JJ Quisquater, L Perret, G Renault Christophe Petit

Source URL: caramba.loria.fr

• Mathematics
• Polynomials
• Algebra
• Equations
• Applied mathematics
• Computer algebra
• Cryptanalysis
• System of polynomial equations
• Data Encryption Standard
• Algebraic equation
• Crypto

BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 44, Number 4, October 2007, Pages 515–539 SArticle electronically published on June 26, 2007

Source URL: www.ams.org

• Mathematics
• Mathematical analysis
• Number theory
• Bernoulli number
• Basel problem
• Trigonometric functions
• Gamma function
• Polylogarithm
• Wallis product
• Bernoulli polynomials

Polynomials, quantum query complexity, and Grothendieck’s inequality Scott Aaronson1 , Andris Ambainis2 , J¯anis Iraids2 , Martins Kokainis2 , Juris Smotrovs2 1 Computer

Source URL: computationalcomplexity.org

Thread boosting and polynomial factorization in NTL Victor Shoup October 21, 2015 As of version 9.5.0, NTL provides a thread boosting feature. With this feature, certain code within NTL will use available threads to spee

Source URL: www.shoup.net

• Parallel computing
• Algebra
• Polynomials
• Computer algebra
• Arithmetic
• Factorization of polynomials
• Multi-core processor
• Factorization
• Speedup

Solving efficiently structured polynomial systems and Applications in Cryptology Jean-Charles Faugère Joint work with: L. Huot

Source URL: ecc2011.loria.fr

• Computer algebra
• Algebraic geometry
• Polynomials
• Algebra
• Commutative algebra
• Grbner basis
• Monomial order
• System of polynomial equations
• Resultant
• Monomial
• Lexicographical order
• Jean-Charles Faugre