Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing

DOI10.1007/978-3-642-29101-2_16zbMath1291.94156OpenAlexW191655252MaRDI QIDQ2894363

Takuya Hayashi, Tsuyoshi Takagi, Naoyuki Shinohara, Takeshi Shimoyama

Publication date: 29 June 2012

Published in: Information Security Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29101-2_16

zbMATH Keywords

finite fielddiscrete logarithm problempairing-based cryptosystemskey lengthsuitable values

Mathematics Subject Classification ID

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

Related Items (2)

Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity ⋮ Counting irreducible polynomials over GF(3) with first and third coefficients given

This page was built for publication: Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing