On the relationship between squared pairings and plain pairings

DOI10.1016/J.IPL.2005.11.005zbMATH Open1191.68279OpenAlexW2060916507MaRDI QIDQ1045941FDOQ1045941

Authors: Bo Gyeong Kang, Je Hong Park 

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.11.005

Recommendations

• Algorithmic Number Theory
• The Eta Pairing Revisited
• Efficient pairing computation on supersingular abelian varieties
• Faster explicit formulas for computing pairings over ordinary curves
• On Compressible Pairings and Their Computation

zbMATH Keywords

cryptographypairing computationpairing-based cryptosystemssquared pairingWeil/Tate pairing

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Cites Work

• Short signatures from the Weil pairing
• Identity-Based Encryption from the Weil Pairing
• Efficient pairing computation on supersingular abelian varieties
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Cryptology - ASIACRYPT 2003
• Selected Areas in Cryptography
• Cryptography and Coding
• Title not available (Why is that?)
• Hyperelliptic Pairings
• Algorithmic Number Theory
• Efficient implementation of pairing-based cryptosystems

Cited In (3)

• On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
• Computing bilinear pairings on elliptic curves with automorphisms
• Comparing two pairing-based aggregate signature schemes

This page was built for publication: On the relationship between squared pairings and plain pairings

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