Progress in Cryptology - INDOCRYPT 2004

DOI10.1007/b104579zbMath1115.94004OpenAlexW2475752160WikidataQ27991510 ScholiaQ27991510MaRDI QIDQ5712193

Gildas Avoine, Jean Monnerat, Thomas Peyrin

Publication date: 22 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b104579

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (3)

Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form ⋮ Redundant \(\tau \)-adic expansions. I: Non-adjacent digit sets and their applications to scalar multiplication ⋮ Analysis of alternative digit sets for nonadjacent representations

This page was built for publication: Progress in Cryptology - INDOCRYPT 2004