Efficient algorithms for speeding up the computations of elliptic curve cryptosystems

DOI10.1016/j.amc.2004.10.010zbMath1076.94017OpenAlexW2025361551MaRDI QIDQ2572747

Chih-Ho Chou, Woei-Jiunn Tsaur

Publication date: 4 November 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.10.010

Mathematics Subject Classification ID

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

Related Items (1)

A blind signature-based protocol for tracing traitors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum weight modified signed-digit representations and fast exponentiation
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Elliptic Curve Cryptosystems
• Computing Sequences with Addition Chains
• A Survey of Fast Exponentiation Methods
• Speeding up the computations on an elliptic curve using addition-subtraction chains

This page was built for publication: Efficient algorithms for speeding up the computations of elliptic curve cryptosystems