Efficient message transmission via twisted Edwards curves

DOI10.1515/ms-2017-0444zbMath1472.94055OpenAlexW3116994096MaRDI QIDQ5145769

Barış Bülent Kırlar

Publication date: 21 January 2021

Published in: Mathematica Slovaca (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/ms-2017-0444

zbMATH Keywords

twisted Edwards curveIND-CCAIND-CPAone-waynesspublic key encryption schemeNyberg-Rueppel digital signature algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

Efficient Nyberg-Rueppel type of NTRU digital signature algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects
• Message recovery for signature schemes based on the discrete logarithm problem
• Partitions and compositions over finite fields
• An application of crypto cloud computing in social networks by cooperative game theory
• Message transmission for GH-public key cryptosystem
• Contemporary cryptology.
• On reusing ephemeral keys in Diffie-Hellman key agreement protocols
• The complexity of certain multi-exponentiation techniques in cryptography
• Twisted Edwards Curves
• Twisted Edwards Curves Revisited
• A public key cryptosystem and a signature scheme based on discrete logarithms
• On the k-th order lfsr sequence with public key cryptosystems
• Faster Addition and Doubling on Elliptic Curves
• A normal form for elliptic curves
• Accelerated Verification of ECDSA Signatures

This page was built for publication: Efficient message transmission via twisted Edwards curves