Digit Set Randomization in Elliptic Curve Cryptography

DOI10.1007/978-3-540-74871-7_10MaRDI QIDQ3608503zbMATH OpenOpenAlexFDO

Authors David D. Yao, S. Ramesh Raju, Ramarathnam Venkatesan

Publication date 5 March 2009

Published in Stochastic Algorithms: Foundations and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74871-7_10

zbMATH Keywords

elliptic curve cryptographynon-adjacent form representationsrandomized representationsside channel attack countermeasures

Mathematics Subject Classification ID

Randomized algorithms (68W20) Cryptography (94A60)

Recommendations

• Pseudorandom Bits From Points on Elliptic Curves
• Elliptic curve analogues of a pseudorandom generator
• On Randomness Extraction in Elliptic Curves
• scientific article; zbMATH DE number 1440879
• Elliptic Curve Cryptosystems
• Derandomization in Cryptography
• Advances in Cryptology - CRYPTO 2003
• scientific article; zbMATH DE number 5529048
• scientific article; zbMATH DE number 1349933
• scientific article; zbMATH DE number 1727433

Cited in

(3)

• Analysis of the Binary Asymmetric Joint Sparse Form
• Information and Communications Security
• Balanced non-adjacent forms

This page was built for publication: Digit Set Randomization in Elliptic Curve Cryptography

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