Message transmission for GH-public key cryptosystem

DOI10.1016/j.cam.2013.10.005zbMath1338.94060OpenAlexW1971962600MaRDI QIDQ2349638

Yanyan Li

Publication date: 17 June 2015

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2013.10.005

zbMATH Keywords

public key cryptosystemsdigital signaturesemantic securitydouble exponentiationthird order LFSR

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Efficient Nyberg-Rueppel type of NTRU digital signature algorithm ⋮ An application of crypto cloud computing in social networks by cooperative game theory ⋮ A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects ⋮ Efficient message transmission via twisted Edwards curves ⋮ An overview of trace based public key cryptography over finite fields

Cites Work

• Message recovery for signature schemes based on the discrete logarithm problem
• On reusing ephemeral keys in Diffie-Hellman key agreement protocols
• Compression in Finite Fields and Torus-Based Cryptography
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Looking beyond XTR
• Public-key cryptosystems based on cubic finite field extensions
• Generating Large Instances of the Gong-Harn Cryptosystem
• An Efficient Formula for Linear Recurrences
• Advances in Cryptology - CRYPTO 2003
• New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
• Selecting cryptographic key sizes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Message transmission for GH-public key cryptosystem