Aspects of Pairing Inversion

DOI10.1109/TIT.2008.2006431zbMATH Open1189.14032DBLPjournals/tit/GalbraithHV08OpenAlexW2139934216WikidataQ61914050 ScholiaQ61914050MaRDI QIDQ3604960FDOQ3604960

Authors: Steven D. Galbraith, Florian Hess, Frederik Vercauteren 

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2008.2006431

Recommendations

• On Pairing Inversion Problems
• Simplified pairing computation and security implications
• Pairing inversion via non-degenerate auxiliary pairings
• Pairing inversion for finding discrete logarithms
• Exponentiation inversion problem reduced from fixed argument pairing inversion on twistable ate pairing and its difficulty

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cited In (11)

• Still wrong use of pairings in cryptography
• Higher-order side channel security and mask refreshing
• On Pairing Inversion Problems
• ON BOUNDS FOR BALANCED EMBEDDING DEGREE
• The Hidden Root Problem
• Exponentiation inversion problem reduced from fixed argument pairing inversion on twistable ate pairing and its difficulty
• Pairing inversion for finding discrete logarithms
• Cryptanalysis of pairing-based cryptosystems over small characteristic fields
• Fixed argument pairing inversion on elliptic curves
• Conjunctive hierarchical multi-secret sharing scheme using elliptic curves
• The Diffie-Hellman problem and generalization of Verheul's theorem

This page was built for publication: Aspects of Pairing Inversion

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