Search results for "multiplication"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
109	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
88	Christopher Umans	Group-theoretic algorithms for matrix multiplication.	ISSAC	2006	DBLP DOI BibTeX RDF	matrix multiplication, finite groups, representation theory
71	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
65	Laszlo Hars	Long Modular Multiplication for Cryptographic Applications.	CHES	2004	DBLP DOI BibTeX RDF	Quisquater multiplication, multiply-accumulate architecture, optimization, cryptography, Computer arithmetic, Montgomery multiplication, reciprocal, modular multiplication, Modular reduction
60	Dong-Ho Lee, Jong-Soo Oh	Multi-segment GF(2m) multiplication and its application to elliptic curve cryptography.	ACM Great Lakes Symposium on VLSI	2007	DBLP DOI BibTeX RDF	elliptic curve scalar multiplication, FPGA, elliptic curve cryptography (ECC), coprocessor, finite field multiplication
59	Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume	Bipartite modular multiplication with twice the bit-length of multipliers.	Int. J. Inf. Sec.	2009	DBLP DOI BibTeX RDF	Bipartite modular multiplication, Double-size technique, RSA, Smartcard, Montgomery multiplication, Modular multiplication
55	Erkay Savas, Alexandre F. Tenca, Çetin Kaya Koç	A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m).	CHES	2000	DBLP DOI BibTeX RDF	Prime fields, binary extension fields, scalability, multiplication, hardware implementation, Montgomery multiplication
55	Ping Tak Peter Tang	Modular Multiplication using Redundant Digit Division.	IEEE Symposium on Computer Arithmetic	2007	DBLP DOI BibTeX RDF
54	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
54	Hyuk-Jae Lee, José A. B. Fortes	Toward data distribution independent parallel matrix multiplication.	IPPS	1995	DBLP DOI BibTeX RDF	data distribution independent, time-space mappings, DDI programs, parallel algorithms, parallel programming, distributed memory systems, matrix multiplication, matrix multiplication, distributed memory parallel computers, parallel matrix multiplication
49	Raphael Yuster, Uri Zwick	Fast sparse matrix multiplication.	ACM Trans. Algorithms	2005	DBLP DOI BibTeX RDF	Matrix multiplication, sparse matrices
49	Katsuyuki Okeya, Kouichi Sakurai	Fast Multi-scalar Multiplication Methods on Elliptic Curves with Precomputation Strategy Using Montgomery Trick.	CHES	2002	DBLP DOI BibTeX RDF	multi-scalar multiplication, Montgomery trick, elliptic curve cryptography, precomputation, simultaneous
49	Philipp Woelfel	On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism.	CCC	2002	DBLP DOI BibTeX RDF	Lower Bounds, BDDs, Nondeterminism, Branching Programs, Integer Multiplication
49	Markus Bläser	Bivariate Polynomial Multiplication.	FOCS	1998	DBLP DOI BibTeX RDF	multiplicative complexity, polynomial multiplication, bilinear complexity
48	Viktor Bunimov, Manfred Schimmler	Efficient Parallel Multiplication Algorithm for Large Integres.	Euro-Par	2003	DBLP DOI BibTeX RDF	large number arithmetic, redundant numbers, Computer arithmetic, integer multiplication, carry save addition, parallel multiplication
48	Viktor Bunimov, Manfred Schimmler	Area and Time Efficient Modular Multiplication of Large Integers.	ASAP	2003	DBLP DOI BibTeX RDF	Montgomery algorithm, interleaved modular multiplication, MSB-first arithmetic, redundant number arithmetic, Modular multiplication, carry save addition
48	John Lloyd	Parallel Formulations of Matrix-Vector Multiplication for Matrices with Large Aspect Ratios.	PDP	1996	DBLP DOI BibTeX RDF	parallel formulations, large aspect ratio matrices, square matrices, square meshes, wraparound connections, parallel algorithms, parallel algorithms, parallel architectures, parallel architectures, partitioning, hypercubes, hypercube networks, matrix multiplication, communication overhead, matrix-vector multiplication
44	Colin D. Walter, Susan Thompson	Distinguishing Exponent Digits by Observing Modular Subtractions.	CT-RSA	2001	DBLP DOI BibTeX RDF	m-ary method, power analysis, sliding windows, Exponentiation, Montgomery multiplication, modular multiplication, timing attack, RSA cryptosystem
44	Belle W. Y. Wei, He Du, Honglu Chen	A complex-number multiplier using radix-4 digits.	IEEE Symposium on Computer Arithmetic	1995	DBLP DOI BibTeX RDF	complex-number multiplier, radix-4 digits, arithmetic datapath, complex-number digital signal processor, binary signed digits, fast multiplication, compact layout, three-multiplication scheme, radix-4 operands, delays, delay, encoding, digital arithmetic, multiplying circuits, binary additions, coding scheme
43	Paul Bao, Lei Zhang 0006, Xiaolin Wu 0001	Canny Edge Detection Enhancement by Scale Multiplication.	IEEE Trans. Pattern Anal. Mach. Intell.	2005	DBLP DOI BibTeX RDF
43	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
43	Ming-Chang Lee	A Divide-and-Conquer Strategy and PVM Computation Environment for the Matrix Multiplication.	ICA3PP	2009	DBLP DOI BibTeX RDF	Strassen’s algorithm, Winograd’s algorithm, efficiency, Matrix multiplication, speedup, PVM
43	Arash Hariri, Arash Reyhani-Masoleh	Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields.	WAIFI	2008	DBLP DOI BibTeX RDF	Shifted polynomial basis, binary extension fields, digit-serial, multiplication
43	Bahador Bakhshi, Babak Sadeghiyan	A Timing Attack on Blakley's Modular Multiplication Algorithm, and Applications to DSA.	ACNS	2007	DBLP DOI BibTeX RDF	Blakley’s algorithm, modular multiplication, timing attack, DSA
43	Pradeep Kumar Mishra, Vassil S. Dimitrov	Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation.	ISC	2007	DBLP DOI BibTeX RDF	Quintupling, Efficient Curve Arithmetic, Elliptic Curve Cryptosystems, Scalar Multiplication
43	Ricardo Dahab, Darrel Hankerson, Fei Hu, Men Long, Julio César López-Hernández, Alfred Menezes	Software Multiplication Using Gaussian Normal Bases.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	Multiplication in {hbox{rlap{I}kern 2.0pt{hbox{F}}}}_{2^m}, elliptic curve cryptography, Gaussian normal basis
43	Toru Akishita, Masanobu Katagi, Izuru Kitamura	SPA-Resistant Scalar Multiplication on Hyperelliptic Curve Cryptosystems Combining Divisor Decomposition Technique and Joint Regular Form.	CHES	2006	DBLP DOI BibTeX RDF	theta divisor, signed binary representation, scalar multiplication, simple power analysis, hyperelliptic curve cryptosystems
43	Nicolas Boullis, Arnaud Tisserand	Some Optimizations of Hardware Multiplication by Constant Matrices.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	multiplication by constants, common subexpressions sharing, Computer arithmetic, FIR filter
43	Hisayoshi Sato, Daniel Schepers, Tsuyoshi Takagi	Exact Analysis of Montgomery Multiplication.	INDOCRYPT	2004	DBLP DOI BibTeX RDF	randomization, elliptic curve cryptosystem, Montgomery multiplication, timing attack
43	Tae-Jun Park, Mun-Kyu Lee, Kunsoo Park	Efficient Scalar Multiplication in Hyperelliptic Curves Using A New Frobenius Expansion.	ICISC	2003	DBLP DOI BibTeX RDF	Scalar Multiplication, Hyperelliptic Curve, Frobenius Expansion
43	Yasuyuki Sakai, Kouichi Sakurai	Algorithms for Efficient Simultaneous Elliptic Scalar Multiplication with Reduced Joint Hamming Weight Representation of Scalars.	ISC	2002	DBLP DOI BibTeX RDF	Elliptic Curve Cryptosystems, Scalar Multiplication
43	Yasuyuki Sakai, Kouichi Sakurai	On the Power of Multidoubling in Speeding Up Elliptic Scalar Multiplication.	Selected Areas in Cryptography	2001	DBLP DOI BibTeX RDF	Montgomery form, Multidoubling, Elliptic curve cryptosystems, Scalar multiplication, Fast implementation
43	Keqin Li 0001, Yi Pan 0001, Si-Qing Zheng	Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array With a Reconfigurable Pipelined Bus System.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	Compound algorithm, optical pipelined bus, Strassen's algorithm, reconfigurability, matrix multiplication, linear array
43	Haining Fan, M. Anwar Hasan	Relationship between GF(2m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	Montgomery multiplication algorithm, shifted polynomial basis, Finite field, multiplication, polynomial basis, irreducible trinomial
43	Alexandre F. Tenca, Çetin Kaya Koç	A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	modular multiplier, scalable multiplier, Cryptography, Montgomery multiplication, modular multiplication
43	J. Choi	A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers.	IPPS	1997	DBLP DOI BibTeX RDF	fast scalable universal matrix multiplication algorithm, distributed-memory concurrent computers, distribution-independent matrix multiplication algorithm, DIMMA, modified pipelined communication scheme, computation/communication overlap, LCM block concept, maximum performance, sequential BLAS routine, SUMMA, Intel Paragon computer, distributed memory systems, block size
42	Ronald J. Cosentino, John J. Vaccaro	Adaptation of the Mactaggart and Jack Complex Multiplication Algorithm for Floating-Point Operators.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	Mactaggart complex multiplication, Jack complex multiplication algorithm, floating-point operators, vector cross-products, digital arithmetic, matrix multiplication, hardware implementation
39	Kensuke Kawakami, Koji Shigemoto, Koji Nakano	Redundant Radix-2r Number System for Accelerating Arithmetic Operations on the FPGAs.	PDCAT	2008	DBLP DOI BibTeX RDF
39	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
39	Wieland Fischer, Jean-Pierre Seifert	Increasing the Bitlength of a Crypto-Coprocessor.	CHES	2002	DBLP DOI BibTeX RDF	Arithmetical coprocessor, Hardware/Software codesign, Modular multiplication, Hardware architecture
39	Souichi Okada, Naoya Torii, Kouichi Itoh, Masahiko Takenaka	Implementation of Elliptic Curve Cryptographic Coprocessor over GF(2m) on an FPGA.	CHES	2000	DBLP DOI BibTeX RDF	elliptic scalar multiplication over tex2html_wrap_inline100, IEEE P1363, Elliptic curve cryptography (ECC), multiplier, coprocessor, Koblitz curve
39	Colin D. Walter	Data Integrity in Hardware for Modular Arithmetic.	CHES	2000	DBLP DOI BibTeX RDF	checker circuit, fault tolerance, testing, cryptography, data integrity, RSA, Computer arithmetic, correctness, error correction, soft errors, Montgomery multiplication, modular multiplication, modular exponentiation
39	Kiamal Z. Pekmastzi	Multiplexer-Based Array Multipliers.	IEEE Trans. Computers	1999	DBLP DOI BibTeX RDF	multiplication algorithm, two's complement multiplication, pipeline multipliers, Array multipliers
38	Kazuyuki Tanimura, Ryuta Nara, Shunitsu Kohara, Kazunori Shimizu, Youhua Shi, Nozomu Togawa, Masao Yanagisawa, Tatsuo Ohtsuki	Scalable unified dual-radix architecture for Montgomery multiplication in GF(P) and GF(2n).	ASP-DAC	2008	DBLP DOI BibTeX RDF
38	Koji Shigemoto, Kensuke Kawakami, Koji Nakano	Accelerating Montgomery Modulo Multiplication for Redundant Radix-64k Number System on the FPGA Using Dual-Port Block RAMs.	EUC (1)	2008	DBLP DOI BibTeX RDF
38	Wu-An Kuo, TingTing Hwang, Allen C.-H. Wu	A power-driven multiplication instruction-set design method for ASIPs.	IEEE Trans. Very Large Scale Integr. Syst.	2006	DBLP DOI BibTeX RDF
38	Venkataraman Mahalingam, Nagarajan Ranganathan	Improving Accuracy in Mitchell's Logarithmic Multiplication Using Operand Decomposition.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	interpolation, Computer arithmetic, error analysis, logarithmic number system
38	Khaled M. Elbassioni	On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization.	ESA	2006	DBLP DOI BibTeX RDF
38	Cor Meenderinck, Sorin Cotofana	Electron counting based high-radix multiplication in single electron tunneling technology.	ISCAS	2006	DBLP DOI BibTeX RDF
38	Yun Yang, Wenqing Zhao, Yasuaki Inoue	High-performance systolic arrays for band matrix multiplication.	ISCAS (2)	2005	DBLP DOI BibTeX RDF
38	Wu-An Kuo, TingTing Hwang, Allen C.-H. Wu	A power-driven multiplication instruction-set design method for ASIPs.	ISCAS (4)	2005	DBLP DOI BibTeX RDF
38	Joong Chul Yoon, Seok Won Jung, Sungwoo Lee	Architecture for an Elliptic Curve Scalar Multiplication Resistant to Some Side-Channel Attacks.	ICISC	2003	DBLP DOI BibTeX RDF
38	Michael J. Schulte, Louis Marquette, Shankar Krithivasan, E. George Walters III, John Glossner	Combined Multiplication and Sum-of-Squares Units.	ASAP	2003	DBLP DOI BibTeX RDF
38	Tetsuya Izu, Tsuyoshi Takagi	A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks.	Public Key Cryptography	2002	DBLP DOI BibTeX RDF
38	Shugang Wei, Shuangching Chen, Kensuke Shimizu	Fast modular multiplication using Booth recoding based on signed-digit number arithmetic.	APCCAS (2)	2002	DBLP DOI BibTeX RDF
38	René J. van der Vleuten	New Methods for Multiplication-Free Arithmetic Coding.	Data Compression Conference	1999	DBLP DOI BibTeX RDF
38	Farhad Fuad Islam, Keikichi Tamaru	High speed merged array multiplication.	J. VLSI Signal Process.	1995	DBLP DOI BibTeX RDF
38	Philip M. Spira	The Time Required for Group Multiplication.	J. ACM	1969	DBLP DOI BibTeX RDF
37	Yuta Sasaki, Satsuki Nishina, Masaaki Shirase, Tsuyoshi Takagi	An Efficient Residue Group Multiplication for the etaT Pairing over F3m.	Selected Areas in Cryptography	2009	DBLP DOI BibTeX RDF	residue group, Vandermonde matrix, pairing, Finite field multiplication
37	Miaoqing Huang, Kris Gaj, Soonhak Kwon, Tarek A. El-Ghazawi	An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm.	Public Key Cryptography	2008	DBLP DOI BibTeX RDF	MWR2MM Algorithm, Field Programmable Gate Arrays, Montgomery Multiplication
37	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
37	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
37	Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume	Double-Size Bipartite Modular Multiplication.	ACISP	2007	DBLP DOI BibTeX RDF	bipartite modular multiplication, double-size technique, RSA, smartcard, crypto-coprocessor
37	Xianming Chen, Richard F. Riesenfeld, Elaine Cohen	Sliding windows algorithm for B-spline multiplication.	Symposium on Solid and Physical Modeling	2007	DBLP DOI BibTeX RDF	NURBS multiplication, sliding windows algorithm, blossoming
37	Bangju Wang, Huanguo Zhang, Zhang-yi Wang, Yuhua Wang	Speeding Up Scalar Multiplication Using a New Signed Binary Representation for Integers.	MCAM	2007	DBLP DOI BibTeX RDF	signed binary representation (SBR), elliptic curve cryptosystems (ECC), public key cryptosystem, scalar multiplication
37	Arash Reyhani-Masoleh	Efficient Algorithms and Architectures for Field Multiplication Using Gaussian Normal Bases.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	software algorithms, normal basis, ECDSA, Finite field multiplication, Gaussian normal basis
37	Arnaud Boscher, Robert Naciri	Optimal Use of Montgomery Multiplication on Smart Cards.	CARDIS	2006	DBLP DOI BibTeX RDF	GQ2, Smart Card, RSA, Montgomery Multiplication, ECDSA
37	Marcelo E. Kaihara, Naofumi Takagi	A Hardware Algorithm for Modular Multiplication/Division.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	modular division, cryptography, Computer arithmetic, modular multiplication, redundant representation, hardware algorithm
37	Pradeep Kumar Mishra	Efficient Simultaneous Inversion in Parallel and Application to Point Multiplication in ECC.	CISC	2005	DBLP DOI BibTeX RDF	Montgomery ladder, simultaneous inversion, parallel algorithm, Elliptic Curve Cryptosystems, Scalar Multiplication
37	Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaume	Short Memory Scalar Multiplication on Koblitz Curves.	CHES	2005	DBLP DOI BibTeX RDF	NAF, change-of-basis, Elliptic curve cryptosystems, smartcard, scalar multiplication, normal basis, Koblitz curves, polynomial basis
37	Palash Sarkar 0001, Pradeep Kumar Mishra, Rana Barua	New Table Look-Up Methods for Faster Frobenius Map Based Scalar Multiplication Over GF(pn).	ACNS	2004	DBLP DOI BibTeX RDF	elliptic curves, Scalar multiplication, hyperelliptic curves, normal basis, look-up table, window methods, Frobenius map
37	Jun-Cheol Jeon, Kee-Young Yoo	An Evolutionary Approach to the Design of Cellular Automata Architecture for Multiplication in Elliptic Curve Cryptography over Finite Fields.	PRICAI	2004	DBLP DOI BibTeX RDF	Evolutionary Computation, Cellular Automata, Finite Fields, Elliptic Curve Cryptography, Multiplication, Irreducible Polynomial
37	Sascha Hunold, Thomas Rauber, Gudula Rünger	Multilevel hierarchical matrix multiplication on clusters.	ICS	2004	DBLP DOI BibTeX RDF	strassen's algorithm, matrix multiplication, task parallelism, multiprocessor tasks
37	Pradeep Kumar Mishra	Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems.	CHES	2004	DBLP DOI BibTeX RDF	Jacobian coordinates, pipelining, Elliptic curve cryptosystems, scalar multiplication
37	Arash Reyhani-Masoleh, M. Anwarul Hasan	Efficient Multiplication Beyond Optimal Normal Bases.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	normal bases, optimal bases, Finite fields, multiplication, composite fields
37	Martin Sauerhoff, Philipp Woelfel	Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions.	STOC	2003	DBLP DOI BibTeX RDF	hash class, lower bound, branching program, time-space tradeoff, integer multiplication, random access machine
37	Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K. Patnala, Mithuna Thottethodi	Recursive Array Layouts and Fast Matrix Multiplication.	IEEE Trans. Parallel Distributed Syst.	2002	DBLP DOI BibTeX RDF	matrix multiplication, Data layout
37	Uri Zwick	All pairs shortest paths using bridging sets and rectangular matrix multiplication.	J. ACM	2002	DBLP DOI BibTeX RDF	shortest paths, Matrix multiplication
37	Arash Reyhani-Masoleh, M. Anwarul Hasan	Fast Normal Basis Multiplication Using General Purpose Processors.	Selected Areas in Cryptography	2001	DBLP DOI BibTeX RDF	software algo- rithms, normal basis, ECDSA, Finite field multiplication, composite fields
37	Hanae Nozaki, Masahiko Motoyama, Atsushi Shimbo, Shin-ichi Kawamura	Implementation of RSA Algorithm Based on RNS Montgomery Multiplication.	CHES	2001	DBLP DOI BibTeX RDF	RSA cryptography, residue number systems, Montgomery multiplication, modular exponentiation
37	M. Anwarul Hasan	Look-Up Table-Based Large Finite Field Multiplication in Memory Constrained Cryptosystems.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	Galois (or finite) field multiplication, cryptographic systems, polynomial basis and look-up tables, Computer arithmetic
37	William L. Freking, Keshab K. Parhi	Performance-Scalable Array Architectures for Modular Multiplication.	ASAP	2000	DBLP DOI BibTeX RDF	high-radix algorithms, cylindrical arrays, folding transformation, systolic arrays, modular multiplication, scalable architectures
37	T. H. Tse, Zhiquan Zhou, Tsong Yueh Chen	Testing of Large Number Multiplication Functions in Cryptographic Systems.	APAQS	2000	DBLP DOI BibTeX RDF	Cryptographic systems, large number multiplication, software testing
37	Markus Bläser	A 5/2 n2-Lower Bound for the Rank of n×n Matrix Multiplication over Arbitrary Fields.	FOCS	1999	DBLP DOI BibTeX RDF	associative algebras, computational complexity, rank, matrix multiplication, bilinear complexity
37	William L. Freking, Keshab K. Parhi	A Unified Method for Iterative Computation of Modular Multiplication and Reduction Operations.	ICCD	1999	DBLP DOI BibTeX RDF	public-key cryptography, modular multiplication, modular reduction, iterative computation
37	Robert Michael Owens, Raminder Singh Bajwa, Mary Jane Irwin	Reducing the number of counters needed for integer multiplication.	IEEE Symposium on Computer Arithmetic	1995	DBLP DOI BibTeX RDF	counting circuits, reasonably small integers, partial product accumulation, aperiodic convolution, convolution algorithms, partial product formulation, fairly large integers, digital arithmetic, multiplying circuits, counters, integer multiplication
37	Daniel S. Roche	Space- and time-efficient polynomial multiplication.	ISSAC	2009	DBLP DOI BibTeX RDF	time-space tradeoff, polynomial multiplication, integer multiplication, space efficiency
37	Volker Müller 0001	Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two.	J. Cryptol.	1998	DBLP DOI BibTeX RDF	Characteristic two, Frobenius endomorphism, Characteristic two, Frobenius endomorphism, Elliptic curves, Elliptic curves, Multiplication, Multiplication, Key words, Frobenius expansion, Frobenius expansion
37	Jang Sun Lee, Sung-Yong Park, P. Bruce Berra, Sanjay Ranka	I/O and memory-efficient matrix multiplication with user-controllable parallel I/O.	ICPADS	1997	DBLP DOI BibTeX RDF	memory-efficient matrix multiplication, user-controllable parallel I/O, high-performance external computation codes, I/O planning, computation planning, communication planning, UPIO, high performance external computation codes, algorithms, codes, matrix multiplication, data distribution, data reuse, access patterns, parallel access, file structure
37	Menghui Zheng, Alexander Albicki	Low power and high speed multiplication design through mixed number representations.	ICCD	1995	DBLP DOI BibTeX RDF	high speed multiplication, mixed number representations, low power multiplication, reduced switching, Sign-Magnitude, Redundant Binary adder, Booth decoder, Carry-Propagation-Free, digital arithmetic, VLSI architecture, redundant number systems, Partial Products
34	Mikkel Thorup	On AC0 implementations of fusion trees and atomic heaps.	SODA	2003	DBLP BibTeX RDF
34	Christos A. Papachristou	Associative table lookup processing for multioperand residue arithmetic.	J. ACM	1987	DBLP DOI BibTeX RDF
33	Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume	Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients.	CT-RSA	2009	DBLP DOI BibTeX RDF	low-end device, double-size technique, RSA, modular multiplication, efficient implementation, crypto-coprocessors, arithmetic unit
33	Erik Dahmen, Katsuyuki Okeya, Tsuyoshi Takagi	An Advanced Method for Joint Scalar Multiplications on Memory Constraint Devices.	ESAS	2005	DBLP DOI BibTeX RDF	joint sparse form, left-to-right, multi-scalar multiplication, shamir method, elliptic curve cryptosystem
33	Chang Hoon Kim, Chun Pyo Hong, Soonhak Kwon	A Novel Arithmetic Unit over GF(2m) for Low Cost Cryptographic Applications.	HPCC	2005	DBLP DOI BibTeX RDF	VLSI, Cryptography, Finite Field, Multiplication, Division
33	Joydip Mitra, Palash Sarkar 0001	Time-Memory Trade-Off Attacks on Multiplications and T-Functions.	ASIACRYPT	2004	DBLP DOI BibTeX RDF	T–functions, cryptanalysis, stream cipher, multiplication, time-memory trade-off
33	Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery	Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation.	CT-RSA	2003	DBLP DOI BibTeX RDF	elliptic curve arithmetic, Elliptic curve cryptosystem, scalar multiplication, pairing-based cryptosystem, ECM
33	Pascal Giorgi, Claude-Pierre Jeannerod, Gilles Villard	On the complexity of polynomial matrix computations.	ISSAC	2003	DBLP DOI BibTeX RDF	column reduced form, matrix gcd, matrix polynomial, minimal basis, polynomial matrix multiplication, determinant
33	Tae-Jun Park, Mun-Kyu Lee, Kunsoo Park	New Frobenius Expansions for Elliptic Curves with Efficient Endomorphisms.	ICISC	2002	DBLP DOI BibTeX RDF	Endomorphism, Elliptic Curve Cryptosystem, Scalar Multiplication, Frobenius Expansion
33	Johann Großschädl	A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m).	CHES	2001	DBLP DOI BibTeX RDF	iterative modulo multiplication, polynomial basis representation, bit-serial multiplier architecture, smart card crypto-coprocessor, Elliptic curve cryptography, finite field arithmetic