Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves

DOI10.1007/978-3-642-32009-5_48zbMath1296.94108OpenAlexW1804070909MaRDI QIDQ2914303

Dimitar Jetchev, Alexandre Duc

Publication date: 25 September 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_48

zbMATH Keywords

Fourier transformelliptic curvesone-way functionbilinear pairingslist decodingfixed argument pairing inversion problemhard-to-compute bits

Mathematics Subject Classification ID

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

Related Items (3)

The Multivariate Hidden Number Problem ⋮ Bit Security of the CDH Problems over Finite Fields ⋮ Unnamed Item

This page was built for publication: Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves