Fast modular composition in any characteristic Kiran S. Kedlaya∗ MIT Christopher Umans† Caltech

First Page		Document Content
Date: 2008-08-04 00:47:22 Computer algebra Computational complexity theory Polynomials Algebra Factorization of polynomials Polynomial Time complexity Reduction Polynomial greatest common divisor Factorization of polynomials over finite fields		Fast modular composition in any characteristic Kiran S. Kedlaya∗ MIT Christopher Umans† Caltech Add to Reading List Source URL: users.cms.caltech.edu Download Document from Source Website File Size: 244,44 KB Share Document on Facebook

	Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions⋆ Daniel Larraz, Albert Oliveras, Enric Rodr´ıguez-Carbonell, and Albert Rubio Universitat Polit`ecnica de Catalunya, Barcelona, Spain DocID: 1xVFd - View Document
	On the Ring-LWE and Polynomial-LWE Problems Miruna Rosca1,2 , Damien Stehlé1 , and Alexandre Wallet1 1 ENS de Lyon, Laboratoire LIP (U. Lyon, CNRS, ENSL, INRIA, UCBL), France DocID: 1xVxG - View Document
	raSAT: SMT for Polynomial Inequality To Van Khanh (UET/VNU-HN) Vu Xuan Tung, Mizuhito Ogawa (JAIST DocID: 1xVsE - View Document
	Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits In memory of Wen-tsun Wu–Jean-Guillaume Dumas DocID: 1xUE0 - View Document
	Secure PRNGs from Specialized Polynomial Maps over Any Fq Feng-Hao Liu1 , Chi-Jen Lu2 , and Bo-Yin Yang2 1 Department of Computer Science, Brown University, Providence RI, USA DocID: 1xUwb - View Document