XTR Algorithm: Efficient and Compact Subgroup Trace Representation

DOI10.1007/978-3-030-60890-3_3zbMath1504.94141OpenAlexW3171385605MaRDI QIDQ5050169

Madan Mohan Singh, Pinkimani Goswami, Dimpi Biswas

Publication date: 15 November 2022

Published in: Functional Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-60890-3_3

zbMATH Keywords

finite fieldtraceDSAcyclotomic polynomialsignature schemeElGamal schemeconjugate elementNR scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• An XTR-based constant round key agreement scheme
• Efficient signature generation by smart cards
• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• Compressed XTR
• Further Security Analysis of XTR
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Elliptic Curve Cryptosystems
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Looking beyond XTR
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Information Security and Privacy
• Information and Communications Security
• Information Security and Privacy
• Selected Areas in Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: XTR Algorithm: Efficient and Compact Subgroup Trace Representation