Search results for "Karatsuba"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
4	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
4	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
3	Jean-Luc Beuchat, Jérémie Detrey, Nicolas Estibals, Eiji Okamoto, Francisco Rodríguez-Henríquez	Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers.	CHES	2009	DBLP DOI BibTeX RDF	Karatsuba-Ofman multiplier, FPGA, elliptic curve, hardware accelerator, Tate pairing, finite field arithmetic, ? T pairing
3	Gang Zhou, Harald Michalik, László Hinsenkamp	Improving Throughput of AES-GCM with Pipelined Karatsuba Multipliers on FPGAs.	ARC	2009	DBLP DOI BibTeX RDF	AES-GCM, pipelined Karatsuba multiplier, FPGAs, finite field arithmetic
3	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
3	Jaewook Chung, M. Anwar Hasan	Asymmetric Squaring Formulae.	IEEE Symposium on Computer Arithmetic	2007	DBLP DOI BibTeX RDF	Karatsuba algorithm, Toom- Cook multiplication algorithm, Montgomery’s Karatsuba-like formulae, Squaring, multiple-precision arithmetic
2	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
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	Chester Rebeiro, Debdeep Mukhopadhyay	Power Attack Resistant Efficient FPGA Architecture for Karatsuba Multiplier.	VLSI Design	2008	DBLP DOI BibTeX RDF
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	Joachim von zur Gathen, Jamshid Shokrollahi	Efficient FPGA-Based Karatsuba Multipliers for Polynomials over F2.	Selected Areas in Cryptography	2005	DBLP DOI BibTeX RDF
2	Ku-Young Chang, Dowon Hong, Hyun-Sook Cho	Low Complexity Bit-Parallel Multiplier for GF(2^m) Defined by All-One Polynomials Using Redundant Representation.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	Karatsuba method, AOP, finite field arithmetic, redundant representation, Bit-parallel multiplier
2	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
2	Serdar S. Erdem, Çetin Kaya Koç	A Less Recursive Variant of Karatsuba-Ofman Algorithm for Multiplying Operands of Size a Power of Two.	IEEE Symposium on Computer Arithmetic	2003	DBLP DOI BibTeX RDF
2	Nadia Nedjah, Luiza de Macedo Mourelle	Fast Less Recursive Hardware for Large Number Multiplication Using Karatsuba-Ofman's Algorithm.	ISCIS	2003	DBLP DOI BibTeX RDF
2	Jaewook Chung, M. Anwar Hasan	More Generalized Mersenne Numbers: (Extended Abstract).	Selected Areas in Cryptography	2003	DBLP DOI BibTeX RDF	Generalized Mersenne Numbers, Karatsuba-Ofman, RSA, XTR, Modular Reduction, Montgomery
2	M. Ernst, Michael Jung, Felix Madlener, Sorin A. Huss, Rainer Blümel	A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over GF(2n).	CHES	2002	DBLP BibTeX RDF	$ mathbb {GF}(2^n)$ arithmetic, Karatsuba multiplication, VHDL model generator, coprocessor synthesis, FPGA hardware acceleration, Atmel FPSLIC platform, Elliptic Curve cryptography
2	Tudor Jebelean	Using the Parallel Karatsuba Algorithm for Long Integer Multiplication and Division.	Euro-Par	1997	DBLP DOI BibTeX RDF
2	Roman Maeder	Storage Allocation for the Karatsuba Integer Multipliation Algorithm.	DISCO	1993	DBLP DOI BibTeX RDF
1	David Harvey	The Karatsuba integer middle product.	J. Symb. Comput.	2012	DBLP DOI BibTeX RDF
1	Yin Li, Gongliang Chen, Jianhua Li	Speedup of bit-parallel Karatsuba multiplier in GF(2m) generated by trinomials.	Inf. Process. Lett.	2011	DBLP DOI BibTeX RDF
1	André Weimerskirch	Karatsuba Algorithm.	Encyclopedia of Cryptography and Security (2nd Ed.)	2011	DBLP DOI BibTeX RDF
1	Sameh M. Shohdy, Ashraf El-Sisi, Nabil A. Ismail	Hardware Implementation of Efficient Modified Karatsuba Multiplier Used in Elliptic Curves.	I. J. Network Security	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	Gang Zhou, Harald Michalik, László Hinsenkamp	Complexity Analysis and Efficient Implementations of Bit Parallel Finite Field Multipliers Based on Karatsuba-Ofman Algorithm on FPGAs.	IEEE Trans. VLSI Syst.	2010	DBLP DOI BibTeX RDF
1	Gary Chun Tak Chow, Ken Eguro, Wayne Luk, Philip Heng Wai Leong	A Karatsuba-Based Montgomery Multiplier.	FPL	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	Y. Hamid, Martin Langhammer	Multiplier architectures for FPGA double precision functions (abstract only).	FPGA	2010	DBLP DOI BibTeX RDF	fpga, floating point
1	Jean-Luc Beuchat, Jérémie Detrey, Nicolas Estibals, Eiji Okamoto, Francisco Rodríguez-Henríquez	Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers.	IACR Cryptology ePrint Archive	2009	DBLP BibTeX RDF
1	Haining Fan, Ming Gu, Jiaguang Sun, Kwok-Yan Lam	Obtaining More Karatsuba-Like Formulae over The Binary Field.	IACR Cryptology ePrint Archive	2009	DBLP BibTeX RDF
1	Daniel J. Bernstein	Batch Binary Edwards.	CRYPTO	2009	DBLP DOI BibTeX RDF	batch throughput, Karatsuba, Toom, binary Edwards curves, differential addition, complete addition formulas, elliptic curves, vectorization, Scalar multiplication, Diffie-Hellman
1	Daniel S. Roche	Space- and time-efficient polynomial multiplication.	ISSAC	2009	DBLP DOI BibTeX RDF	time-space tradeoff, polynomial multiplication, integer multiplication, space efficiency
1	Ling Ding, Éric Schost	Code Generation for Polynomial Multiplication.	CASC	2009	DBLP DOI BibTeX RDF
1	Nidia Cortez-Duarte, Francisco Rodríguez-Henríquez, Jean-Luc Beuchat, Eiji Okamoto	A Pipelined Karatsuba-Ofman Multiplier over GF($3^{97}$) Amenable for Pairing Computation.	IACR Cryptology ePrint Archive	2008	DBLP BibTeX RDF
1	Ashraf El-Sisi, Sameh M. Shohdy, Nabil A. Ismail	Reconfigurable Implementation of Karatsuba Multiplier for Galois Field in Elliptic Curves.	TeNe	2008	DBLP DOI BibTeX RDF
1	Vinodh Gopal, Satyajit Grover, Michael E. Kounavis	Fast multiplication techniques for public key cryptography.	ISCC	2008	DBLP DOI BibTeX RDF
1	Shay Gueron, Michael E. Kounavis	A Technique for Accelerating Characteristic 2 Elliptic Curve Cryptography.	ITNG	2008	DBLP DOI BibTeX RDF
1	Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann	Faster Multiplication in GF(2)[x].	ANTS	2008	DBLP DOI BibTeX RDF
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	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	Jamshid Shokrollahi, Elisa Gorla, Christoph Puttmann	Efficient FPGA-based multipliers for F_3^97 and F_3^(6*97).	FPL	2007	DBLP DOI BibTeX RDF
1	Jean-Pierre David, Kassem Kalach, Nicolas Tittley	Hardware Complexity of Modular Multiplication and Exponentiation.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	Cryptography, Multiplication, Modular Arithmetic, Hardware Complexity
1	Kamel Bentahar, Nigel P. Smart	Efficient 15, 360-bit RSA Using Woop-Optimised Montgomery Arithmetic.	IMA Int. Conf.	2007	DBLP DOI BibTeX RDF
1	Ekatherina A. Karatsuba	On an approach to the study of the Jaynes-Cummings sum in quantum optics.	Numerical Algorithms	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 34A45, 40G99, 41A60, 70K40
1	André Weimerskirch, Christof Paar	Generalizations of the Karatsuba Algorithm for Efficient Implementations.	IACR Cryptology ePrint Archive	2006	DBLP BibTeX RDF
1	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
1	Milan Markovic, Goran Dordevic	On Implementation Aspects of Standard Asymmetric and Symmetric Cryptographic Algorithms on TI Signal Processors.	SecPerU	2006	DBLP DOI BibTeX RDF
1	André Weimerskirch	Karatsuba algorithm.	Encyclopedia of Cryptography and Security	2005	DBLP DOI BibTeX RDF
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	Thomas J. Wollinger, Jan Pelzl, Christof Paar	Cantor versus Harley: Optimization and Analysis of Explicit Formulae for Hyperelliptic Curve Cryptosystems.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	Harley's algorithm, Cantor, embedded implementation, efficient implementation, Hyperelliptic curves, explicit formulae
1	Johann Großschädl, Roberto Maria Avanzi, Erkay Savas, Stefan Tillich	Energy-Efficient Software Implementation of Long Integer Modular Arithmetic.	CHES	2005	DBLP DOI BibTeX RDF
1	Selçuk Baktir, Berk Sunar	Optimal Tower Fields.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF
1	Berk Sunar	A Generalized Method for Constructing Subquadratic Complexity GF(2^k) Multipliers.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF
1	Gennadi I. Malaschonok, E. S. Satina	Fast Multiplication and Sparse Structures.	Programming and Computer Software	2004	DBLP DOI BibTeX RDF
1	Cornelia Grabbe, Marcus Bednara, Jürgen Teich, Joachim von zur Gathen, Jamshid Shokrollahi	FPGA designs of parallel high performance GF(2233) multipliers.	ISCAS	2003	DBLP DOI BibTeX RDF
1	Christof Paar, Peter Fleischmann, Peter Roelse	Efficient Multiplier Architectures for Galois Fields GF(2 4n).	IEEE Trans. Computers	1998	DBLP DOI BibTeX RDF	Karatsuba Ofman, modulo reduction, multiplication, VLSI architecture, Galois fields, bit parallel, composite fields
1	Tudor Jebelean	Practical Integer Division with Karatsuba Complexity.	ISSAC	1997	DBLP BibTeX RDF
1	Jorge Guajardo, Christof Paar	Efficient Algorithms for Elliptic Curve Cryptosystems.	CRYPTO	1997	DBLP DOI BibTeX RDF
1	Giovanni Cesari, Roman Maeder	Performance Analysis of the Parallel Karatsuba Multiplication Algorithm for Distributed Memory Architectures.	J. Symb. Comput.	1996	DBLP DOI BibTeX RDF
1	Giovanni Cesari, Roman Maeder	Parallel 3-Primes FFT Algorithm.	DISCO	1996	DBLP DOI BibTeX RDF
1	Wolfgang Küchlin, David Lutz, Nicholas Nevin	Integer Multiplication in PARSAC-2 on Stock Microprocessors.	AAECC	1991	DBLP DOI BibTeX RDF