Search results for "polynomial multiplication"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Selçuk Baktir, Berk Sunar	Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform.	ACM Southeast Regional Conference	2006	DBLP DOI BibTeX RDF	fermat numbers, fermat transform, Fast Fourier Transform (FFT), finite fields, elliptic curve cryptography, coding theory, polynomial multiplication
3	Markus Bläser	Bivariate Polynomial Multiplication.	FOCS	1998	DBLP DOI BibTeX RDF	multiplicative complexity, polynomial multiplication, bilinear complexity
2	Murat Cenk, Ferruh Özbudak	Improved Polynomial Multiplication Formulas over $IF2$ Using Chinese Remainder Theorem.	IEEE Trans. Computers	2009	DBLP DOI BibTeX RDF
2	Daniel S. Roche	Space- and time-efficient polynomial multiplication.	ISSAC	2009	DBLP DOI BibTeX RDF	time-space tradeoff, polynomial multiplication, integer multiplication, space efficiency
2	Ling Ding, Éric Schost	Code Generation for Polynomial Multiplication.	CASC	2009	DBLP DOI BibTeX RDF
2	Sameh M. Shohdy, Ashraf El-Sisi, Nabil A. Ismail	FPGA Implementation of Elliptic Curve Point Multiplication over GF(2191).	ISA	2009	DBLP DOI BibTeX RDF	Karatsuba-Ofman multiplier, polynomial inversion, field programmable gate arrays, Elliptic curve cryptography, Galois field, polynomial multiplication
2	Jean-Guillaume Dumas	Q-adic transform revisited.	ISSAC	2008	DBLP DOI BibTeX RDF	dqt (discrete q-adic transform), fqt (fast q-adic transform), kronecker substitution, modular polynomial multiplication, redq (simultaneous modular reduction), small extension field, finite field
2	Marco Bodrato, Alberto Zanoni	Integer and polynomial multiplication: towards optimal toom-cook matrices.	ISSAC	2007	DBLP DOI BibTeX RDF	Karatsuba, integer and polynomial multiplication, toom-cook, interpolation, squaring, matrix inversion
2	Mickaël Gastineau, Jacques Laskar	Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries.	International Conference on Computational Science	2006	DBLP DOI BibTeX RDF
2	Nam Su Chang, Chang Han Kim, Young-Ho Park, Jongin Lim	A Non-redundant and Efficient Architecture for Karatsuba-Ofman Algorithm.	ISC	2005	DBLP DOI BibTeX RDF	Karatsuba-Ofman Algorithm, Non-Redundant Karatsuba-Ofman Algorithm, Hardware Architecture, Polynomial Multiplication
1	Sedat Akleylek, Murat Cenk, Ferruh Özbudak	On the Polynomial Multiplication in Chebyshev Form.	IEEE Trans. Computers	2012	DBLP DOI BibTeX RDF
1	Pascal Giorgi	On Polynomial Multiplication in Chebyshev Basis.	IEEE Trans. Computers	2012	DBLP DOI BibTeX RDF
1	Daniel S. Roche	Chunky and equal-spaced polynomial multiplication.	J. Symb. Comput.	2011	DBLP DOI BibTeX RDF
1	Marc Moreno Maza, Yuzhen Xie	Balanced Dense Polynomial Multiplication on Multi-Cores.	Int. J. Found. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Alexey Pospelov	Faster Polynomial Multiplication via Discrete Fourier Transforms.	CSR	2011	DBLP DOI BibTeX RDF
1	Murat Cenk, Christophe Nègre, M. Anwar Hasan	Improved Three-Way Split Formulas for Binary Polynomial Multiplication.	Selected Areas in Cryptography	2011	DBLP DOI BibTeX RDF
1	Ivan V. Oseledets	Improved n-Term Karatsuba-Like Formulas in GF(2).	IEEE Trans. Computers	2011	DBLP DOI BibTeX RDF	Karatsuba algorithm, Chinese remainder theorem, fast algorithm, Polynomial multiplication
1	Alexey Pospelov	Faster Polynomial Multiplication via Discrete Fourier Transforms.	Electronic Colloquium on Computational Complexity (ECCC)	2010	DBLP BibTeX RDF
1	Juliano B. Lima, Daniel Panario, Qiang Wang	A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form.	IEEE Trans. Computers	2010	DBLP DOI BibTeX RDF	computations on polynomials, Theory of computation, analysis of algorithms and problem complexity
1	Pascal Giorgi	On Polynomial Multiplication in Chebyshev Basis	CoRR	2010	DBLP BibTeX RDF
1	Alexey Pospelov	Faster Polynomial Multiplication via Discrete Fourier Transforms	CoRR	2010	DBLP BibTeX RDF
1	Daniel S. Roche	Chunky and Equal-Spaced Polynomial Multiplication	CoRR	2010	DBLP BibTeX RDF
1	David Harvey, Daniel S. Roche	An in-place truncated Fourier transform and applications to polynomial multiplication	CoRR	2010	DBLP BibTeX RDF
1	Sedat Akleylek, Murat Cenk, Ferruh Özbudak	Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity.	INDOCRYPT	2010	DBLP DOI BibTeX RDF
1	David Harvey, Daniel S. Roche	An in-place truncated fourier transform and applications to polynomial multiplication.	ISSAC	2010	DBLP DOI BibTeX RDF
1	Gang Zhou, Harald Michalik	Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field".	IEEE Trans. Computers	2010	DBLP DOI BibTeX RDF	Karatsuba algorithm, finite field, polynomial multiplication
1	David Harvey	Faster polynomial multiplication via multipoint Kronecker substitution.	J. Symb. Comput.	2009	DBLP DOI BibTeX RDF
1	Joris van der Hoeven, Grégoire Lecerf	On the bit-complexity of sparse polynomial multiplication	CoRR	2009	DBLP BibTeX RDF
1	Marc Moreno Maza, Yuzhen Xie	Balanced Dense Polynomial Multiplication on Multi-Cores.	PDCAT	2009	DBLP DOI BibTeX RDF
1	Murat Cenk, Çetin Kaya Koç, Ferruh Özbudak	Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation.	IEEE Symposium on Computer Arithmetic	2009	DBLP DOI BibTeX RDF
1	Michael B. Monagan, Roman Pearce	Parallel sparse polynomial multiplication using heaps.	ISSAC	2009	DBLP DOI BibTeX RDF	parallel, polynomial, multiplication, sparse
1	Norifumi Kamiya, Eisaku Sasaki	Efficient encoding of QC-LDPC codes related to cyclic MDS codes.	IEEE Journal on Selected Areas in Communications	2009	DBLP DOI BibTeX RDF
1	Éric Schost, Arash Hariri	Subquadratic Polynomial Multiplication over GF(2m) Using Trinomial Bases and Chinese Remaindering.	Selected Areas in Cryptography	2008	DBLP DOI BibTeX RDF
1	Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi	Fast integer multiplication using modular arithmetic.	STOC	2008	DBLP DOI BibTeX RDF	computational algebra, modular arithmetic, integer multiplication
1	Christophe Nègre, Thomas Plantard	Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation.	ACISP	2008	DBLP DOI BibTeX RDF	Prime Field, Modular Number System, Lagrange Representation, Modular Multiplication
1	Murat Cenk, Ferruh Özbudak	Efficient Multiplication in F3kn, m>=1 and 5<=l<=18.	AFRICACRYPT	2008	DBLP DOI BibTeX RDF	Chinese Remainder Theorem, pairing based cryptography, finite field multiplication
1	Oleg Lobachev, Rita Loogen	Towards an Implementation of a Computer Algebra System in a Functional Language.	AISC/MKM/Calculemus	2008	DBLP DOI BibTeX RDF	language and system design, computer algebra, software technology
1	Haining Fan, Jiaguang Sun, Ming Gu, Kwok-Yan Lam	Overlap-free Karatsuba-Ofman Polynomial Multiplication Algorithms.	IACR Cryptology ePrint Archive	2007	DBLP BibTeX RDF
1	David Harvey	Faster polynomial multiplication via multipoint Kronecker substitution	CoRR	2007	DBLP BibTeX RDF
1	Haining Fan, M. Anwar Hasan	Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae'.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	Karatsuba algorithm, finite field, polynomial multiplication
1	Daniel J. Bernstein	The Tangent FFT.	AAECC	2007	DBLP DOI BibTeX RDF	Tangent FFT, split-radix FFT, modified split-radix FFT, scaled odd tail, DFT, communication complexity, convolution, polynomial multiplication, algebraic complexity
1	Marco Bodrato	Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0.	WAIFI	2007	DBLP DOI BibTeX RDF	Toom-Cook, Karatsuba, GF2x, binary polynomials, finite fields, convolution, multivariate, squaring, Polynomial multiplication
1	Xin Li, Marc Moreno Maza	Multithreaded parallel implementation of arithmetic operations modulo a triangular set.	PASCO	2007	DBLP DOI BibTeX RDF	algorithms, parallelization, polynomials, high-performance, normal form
1	Michael B. Monagan, Roman Pearce	Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors.	CASC	2007	DBLP DOI BibTeX RDF
1	Nader H. Bshouty, Michael Kaminski	Polynomial multiplication over finite fields: from quadratic to straight-line complexity.	Computational Complexity	2006	DBLP DOI BibTeX RDF	Subject classification. 12Y05, 68Q25, 68W40, 68W30
1	Michael Kaminski	Complexity of Polynomial Multiplication over Finite Fields.	CSR	2006	DBLP DOI BibTeX RDF
1	Selçuk Baktir, Berk Sunar	Finite Field Polynomial Multiplication in the Frequency Domain with Application to Elliptic Curve Cryptography.	ISCIS	2006	DBLP DOI BibTeX RDF	elliptic curve cryptography, DFT, Finite field multiplication
1	Ricardo Chaves, Georgi Kuzmanov, Stamatis Vassiliadis, Leonel Sousa	Reconfigurable memory based AES co-processor.	IPDPS	2006	DBLP DOI BibTeX RDF
1	Melvyn B. Nathanson	Additive Number Theory and the Ring of Quantum Integers.	GTIT-C	2006	DBLP DOI BibTeX RDF
1	Payman Mohassel, Matthew K. Franklin	Efficient Polynomial Operations in the Shared-Coefficients Setting.	Public Key Cryptography	2006	DBLP DOI BibTeX RDF	polynomial operations, threshold homomorphic encryption, privacy-preserving set operations, secure multi-party computation, passive adversary
1	Michael Kaminski	A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields.	SIAM J. Comput.	2005	DBLP DOI BibTeX RDF
1	Michael Kaminski	A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields.	STACS	2005	DBLP DOI BibTeX RDF
1	Peter L. Montgomery	Five, Six, and Seven-Term Karatsuba-Like Formulae.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	Karatsuba, Karatsuba-Ofman, characteristic 2, elliptic curve arithmetic, Galois fields, polynomial multiplication, binary fields
1	Zoya Dyka, Peter Langendoerfer	Area Efficient Hardware Implementation of Elliptic Curve Cryptography by Iteratively Applying Karatsuba's Method.	DATE	2005	DBLP DOI BibTeX RDF
1	Laszlo Hars	Fast Truncated Multiplication for Cryptographic Applications.	CHES	2005	DBLP DOI BibTeX RDF	Short product, Truncated product, Karatsuba multiplication, Barrett multiplication, Optimization, Cryptography, Computer Arithmetic, Montgomery multiplication, Modular multiplication, RSA cryptosystem
1	Ioannis Z. Emiris, Kyriakos Zervoudakis	Successive Linear Programs for Computing All Integral Points in a Minkowski Sum.	Panhellenic Conference on Informatics	2005	DBLP DOI BibTeX RDF	integral points, linear programming, Minkowski sum, polyhedral combinatorics, convex polytope, duality theory
1	Joris van der Hoeven	The truncated fourier transform and applications.	ISSAC	2004	DBLP DOI BibTeX RDF	FFT-multiplication, jump phenomenon, multivariate power series, truncated multiplication, fast fourier transform, multivariate polynomials
1	Berk Sunar	A Generalized Method for Constructing Subquadratic Complexity GF(2^k) Multipliers.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF
1	Alin Bostan, Grégoire Lecerf, Éric Schost	Tellegen's principle into practice.	ISSAC	2003	DBLP DOI BibTeX RDF	Tellegen's principle, transposition principle, interpolation, computer algebra, polynomial evaluation
1	Maneli Noorkami, Faramarz Fekri	An Efficient Finite-Field Convolution to Enhance the Performance of the Wavelet Cryptosystem on Handheld Devices.	ITCC	2003	DBLP DOI BibTeX RDF
1	Man-Lai Tang, Karim F. Hirji	Simple polynomial multiplication algorithms for exact conditional tests of linearity in a logistic model.	Computer Methods and Programs in Biomedicine	2002	DBLP DOI BibTeX RDF
1	Huapeng Wu	Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis.	IEEE Trans. Computers	2002	DBLP DOI BibTeX RDF	hardware architecture, Finite fields arithmetic, polynomial basis
1	M. Shahkarami, Graham A. Jullien, William C. Miller	Designing FIR filters with enhanced Fermat ALUs.	ISCAS	1999	DBLP DOI BibTeX RDF
1	Huapeng Wu	Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis.	CHES	1999	DBLP DOI BibTeX RDF
1	Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen	Lower Bounds for Dynamic Algebraic Problems.	STACS	1999	DBLP DOI BibTeX RDF
1	Çetin Kaya Koç, Tolga Acar	Fast Software Exponentiation in GF(2^k).	IEEE Symposium on Computer Arithmetic	1997	DBLP DOI BibTeX RDF	polynomial arithmetic, Montgomery multiplication, Galois field, squaring
1	Joachim von zur Gathen, Michael Nöcker	Exponentiation in Finite Fields: Theory and Practice.	AAECC	1997	DBLP DOI BibTeX RDF
1	Arnold Schönhage	Bivariate Polynomial Multiplication Patterns.	AAECC	1995	DBLP DOI BibTeX RDF
1	Victor Y. Pan	Simple Multivariate Polynomial Multiplication.	J. Symb. Comput.	1994	DBLP DOI BibTeX RDF
1	A. V. S. Sastry, William D. Clinger	Parallel Destructive Updating in Strict Functional Languages.	LISP and Functional Programming	1994	DBLP DOI BibTeX RDF
1	Shovonlal Kundu	Dense polynomial multiplication with reduced array manipulation overhead.	Inf. Sci.	1993	DBLP DOI BibTeX RDF
1	Michael Kaminski, Nader H. Bshouty	Multiplicative complexity of polynomial multiplication over finite fields.	J. ACM	1989	DBLP DOI BibTeX RDF
1	Michael Kaminski	An Algorithm for Polynomial Multiplication that Does Not Depend on the Ring Constants.	J. Algorithms	1988	DBLP DOI BibTeX RDF
1	Michael Kaminski, Nader H. Bshouty	Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract)	FOCS	1987	DBLP DOI BibTeX RDF
1	Michael Kaminski	A Lower Bound for Polynomial Multiplication.	Theor. Comput. Sci.	1985	DBLP DOI BibTeX RDF
1	David A. Carlson	Time-Space Tradeoffs on Back-to-Back FFT Algorithms.	IEEE Trans. Computers	1983	DBLP DOI BibTeX RDF	straight-line algorithm, time-space tradeoff, polynomial multiplication, Pebble game, permutation graph
1	Mark R. Brown, David P. Dobkin	An Improved Lower Bound on Polynomial Multiplication.	IEEE Trans. Computers	1980	DBLP DOI BibTeX RDF
1	Dorothea A. Klip	New Algorithms for Polynomial Multiplication.	SIAM J. Comput.	1979	DBLP DOI BibTeX RDF
1	Dima Grigoriev	Multiplicative Complexity of a Pair of Bilinear Forms and of the Polynomial Multiplication.	MFCS	1978	DBLP DOI BibTeX RDF
1	Ellis Horowitz	A Sorting Algorithm for Polynomial Multiplication.	J. ACM	1975	DBLP DOI BibTeX RDF
1	Richard J. Fateman	Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments.	SIAM J. Comput.	1974	DBLP DOI BibTeX RDF