Sciweavers

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

41

ACISP
2009
Springer

favoriteEmaildiscussreport

96views Security Privacy» more ACISP 2009»

Random Order m-ary Exponentiation

14 years 3 months ago

Random Order m-ary Exponentiation

Download www.cs.bris.ac.uk

This paper describes a m-ary exponentiation algorithm where the radix-m digits of an exponent can be treated in a somewhat random order without using any more group operations than a standard rightto-left m-ary exponentiation. This paper demonstrates that the random order countermeasure, commonly used to protect implementations of secret key cryptographic algorithms, can be applied to public key cryptographic algorithms.

Michael Tunstall

Real-time Traffic

ACISP 2009 | Key Cryptographic Algorithms | M-ary Exponentiation | M-ary Exponentiation Algorithm |

claim paper

Related Content

» SelfRandomized Exponentiation Algorithms

» Lower Bounds for Quantile Estimation in RandomOrder and Multipass Streaming

» Random 3SAT The Plot Thickens

» Alternative Randomization for Valuing American Options

» On Tail Distribution of Interpost Distance

» Random sampling of moment graph a stochastic Krylovreduction algorithm

» Reduced feedback schemes using random beamforming in MIMO broadcast channels

» Formal Reasoning about Expectation Properties for Continuous Random Variables

» Random 3SAT and BDDs The Plot Thickens Further

Post Info
More Details (n/a)

Added	23 Jul 2010
Updated	23 Jul 2010
Type	Conference
Year	2009
Where	ACISP
Authors	Michael Tunstall

Comments (0)