On the relationship between squared pairings and plain pairings

DOI10.1016/j.ipl.2005.11.005zbMath1191.68279OpenAlexW2060916507MaRDI QIDQ1045941

Je Hong Park, Bo Gyeong Kang

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)

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient implementation of pairing-based cryptosystems
• Short signatures from the Weil pairing
• Efficient pairing computation on supersingular abelian varieties
• Identity-Based Encryption from the Weil Pairing
• Hyperelliptic Pairings
• Algorithmic Number Theory
• Selected Areas in Cryptography
• Cryptography and Coding
• Advances in Cryptology - ASIACRYPT 2003

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