Binary representations of finite fields and their application to complexity theory

DOI10.1006/FFTA.1996.0022zbMath0891.11060OpenAlexW2039415523MaRDI QIDQ1383509

Jürg Ganz

Publication date: 26 April 1998

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.1996.0022

zbMATH Keywords

discrete logarithm problempublic-key cryptographyalgebraic complexitystandard representationbinary representations of finite fieldsBoolean circuit complexity of Zech's logarithmlogarithmic representation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Other number representations (11A67)

This page was built for publication: Binary representations of finite fields and their application to complexity theory