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

DOI10.1007/978-3-642-29101-2_16MaRDI QIDQ2894363zbMATH OpenOpenAlexFDO

Authors Naoyuki Shinohara, Takeshi Shimoyama, Takuya Hayashi, Tsuyoshi Takagi

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

discrete logarithm problemfinite fieldpairing-based cryptosystemskey lengthsuitable values

Mathematics Subject Classification ID

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

Recommendations

• Estimating key sizes for high dimensional lattice-based systems
• Updating key size estimations for pairings
• scientific article; zbMATH DE number 697800
• A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack
• Pairing-based cryptography and its security analysis
• Pairing-based cryptography and its security analysis
• Key-alternating ciphers and key-length extension: exact bounds and multi-user security
• Key size evaluation of provably secure RSA-based encryption schemes
• On pairing-based cryptosystems
• Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)

Cited in

(5)

• Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
• Solving a 676-bit discrete logarithm problem in \(\text{GF}(3^{6n})\)
• Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
• Cryptanalysis of pairing-based cryptosystems over small characteristic fields
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894363)