Advances in Cryptology – CRYPTO 2004

DOI10.1007/b99099zbMath1104.11056arXivmath/0311120OpenAlexW2477011922WikidataQ27980744 ScholiaQ27980744MaRDI QIDQ5311533

Qi Cheng

Publication date: 23 August 2005

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

Full work available at URL: https://arxiv.org/abs/math/0311120

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Decoding (94B35)

Related Items (2)

On the construction of finite field elements of large order ⋮ Proving primality in essentially quartic random time

This page was built for publication: Advances in Cryptology – CRYPTO 2004