scientific article; zbMATH DE number 1303124

MaRDI QIDQ4249639zbMATH OpenFDO

Authors David Naccache, Gilles Zémor, Gérard Cohen, Antoine Lobstein

Publication date 17 June 1999

zbMATH Keywords

RSA-type exponentiations

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Data encryption (aspects in computer science) (68P25)

Recommendations

• scientific article; zbMATH DE number 1950620
• Improved batch exponentiation
• scientific article; zbMATH DE number 1440888
• Correcting noisy exponentiation black-boxes modulo a prime
• IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION
• Faster black-box algorithms through higher arity operators
• scientific article; zbMATH DE number 3879021
• The complexity of computing exponents
• An Algorithm for Computing Optimal Exponent Pairs

Cited in

(2)

• Correcting noisy exponentiation black-boxes modulo a prime
• Enhanced digital signature using RNS digit exponent representation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249639)