On the relationship between squared pairings and plain pairings

DOI10.1016/J.IPL.2005.11.005MaRDI QIDQ1045941zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cryptographypairing computationpairing-based cryptosystemssquared pairingWeil/Tate pairing

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1349933 (Why is no real title available?)
• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• scientific article; zbMATH DE number 2086895 (Why is no real title available?)
• Advances in Cryptology - ASIACRYPT 2003
• Algorithmic Number Theory
• Cryptography and Coding
• Efficient implementation of pairing-based cryptosystems
• Efficient pairing computation on supersingular abelian varieties
• Hyperelliptic Pairings
• Identity-Based Encryption from the Weil Pairing
• Selected Areas in Cryptography
• Short signatures from the Weil pairing

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)