Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve
From MaRDI portal
Publication:2900246
DOI10.1007/978-3-642-30057-8_35zbMath1270.11125OpenAlexW1856405133MaRDI QIDQ2900246
Masaya Yasuda, Goichiro Hanaoka, Tetsuya Izu, Yumi Sakemi, Masahiko Takenaka
Publication date: 20 July 2012
Published in: Public Key Cryptography – PKC 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-30057-8_35
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (7)
Compact Attribute-Based and Online-Offline Multi-input Inner Product Encryptions from Standard Static Assumptions (Short Paper) ⋮ A survey of elliptic curves for proof systems ⋮ Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH ⋮ Vector Commitments and Their Applications ⋮ Research on attacking a special elliptic curve discrete logarithm problem
This page was built for publication: Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve