Approach to Pairing Inversions Without Solving Miller Inversion

DOI10.1109/TIT.2011.2173714zbMATH Open1365.14037OpenAlexW1967164659MaRDI QIDQ5272136FDOQ5272136

Authors: Naoki Kanayama, Eiji Okamoto 

Publication date: 12 July 2017

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

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

Recommendations

• On Pairing Inversion Problems
• Further refinement of pairing computation based on Miller's algorithm
• Alternative Approach to Miller-Paris Transformations and Their Extensions
• The general inversion pair and its applications
• Iterative methods without inversion
• Hahn's pairs and zero inverse problem
• Pseudo-inverses without matrices
• Pairing inversion via non-degenerate auxiliary pairings
• TWO APPROACHES TO MÖBIUS INVERSION
• A practical method for matrix inversion

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cited In (2)

• Higher-order side channel security and mask refreshing
• Fixed argument pairing inversion on elliptic curves

This page was built for publication: Approach to Pairing Inversions Without Solving Miller Inversion

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