Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

58

Voted

ARITH
2001
IEEE

favoriteEmaildiscussreport

92views Applied Computing» more ARITH 2001»

Efficient Computation of Multiplicative Inverses for Cryptographic Applications

15 years 1 months ago

Efficient Computation of Multiplicative Inverses for Cryptographic Applications

Download www.acsel-lab.com

M. Anwarul Hasan

Real-time Traffic

Applied Computing | ARITH 2001 |

claim paper

Related Content

» ItohTsujii Inversion in Standard Basis and Its Application in Cryptography and Codes

» Computing the Modular Inverse of a Polynomial Function over GF2P Using Bit Wise Operation

» SIMD optimization of the H264SVC decoder with efficient data structure

» Selected RNS Bases for Modular Multiplication

» Fast Truncated Multiplication for Cryptographic Applications

» Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applicat...

» Efficient Hardware Architectures for Modular Multiplication on FPGAs

» Long Modular Multiplication for Cryptographic Applications

» Efficient Computation of the Inverse Gradient on Irregular Domains

Post Info
More Details (n/a)

Added	23 Aug 2010
Updated	23 Aug 2010
Type	Conference
Year	2001
Where	ARITH
Authors	M. Anwarul Hasan

Comments (0)