Analysis of fractional window recoding methods and their application to elliptic curve cryptosystems

DOI10.1109/TC.2006.3MaRDI QIDQ3417007zbMATH OpenFDO

Authors Katja Schmidt-Samoa, Olivier Semay, Tsuyoshi Takagi

Publication date 9 January 2007

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2006.3

zbMATH Keywords

signed binary representations

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• On the zero-run length of a signed binary representation
• Topics in Cryptology – CT-RSA 2005
• Analysis of fractional \(\omega\)mbNAF for scalar multiplication
• Fractional Windows Revisited:Improved Signed-Digit Representations for Efficient Exponentiation
• Fast elliptic curve point multiplication based on window non-adjacent form method

Cited in

(5)

• Analysis of fractional \(\omega\)mbNAF for scalar multiplication
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Метод адаптивного «окна» операций в эллиптических кривых
• Fractional Windows Revisited:Improved Signed-Digit Representations for Efficient Exponentiation
• On the zero-run length of a signed binary representation

This page was built for publication: Analysis of fractional window recoding methods and their application to elliptic curve cryptosystems

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