Cryptanalysis of Pairing-Based Cryptosystems Over Small Characteristic Fields

DOI10.1007/978-4-431-54907-9_12zbMath1326.94097OpenAlexW2124625695MaRDI QIDQ3455007

Takuya Hayashi

Publication date: 3 December 2015

Published in: The Impact of Applications on Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-4-431-54907-9_12

zbMATH Keywords

discrete logarithm problemcryptanalysispairing-basedcryptosystem

Mathematics Subject Classification ID

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

Cites Work

• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• Efficient pairing computation on supersingular abelian varieties
• The Eta Pairing Revisited
• Aspects of Pairing Inversion
• Reducing elliptic curve logarithms to logarithms in a finite field
• Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three

This page was built for publication: Cryptanalysis of Pairing-Based Cryptosystems Over Small Characteristic Fields