Transformations of Cryptographic Schemes Through Interpolation Techniques

DOI10.1007/978-3-319-18275-9_1zbMath1382.94042OpenAlexW2267209154MaRDI QIDQ2790421

Gerasimos C. Meletiou, Stamatios-Aggelos N. Alexandropoulos, Dimitrios Triantafyllou, Michael N. Vrahatis

Publication date: 4 March 2016

Published in: Computation, Cryptography, and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18275-9_1

zbMATH Keywords

public key cryptographymatrix factorizationdiscrete logarithmdiffie hellman mappingpolynomial interpolation techniques

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Unnamed Item
• Unnamed Item
• A short proof for explicit formulas for discrete logarithms in finite fields
• Aitken and Neville inverse interpolation methods for the Lucas logarithm problem
• A note on discrete logarithms in finite fields
• On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
• A polynomial representation of the Diffie-Hellman mapping
• Polynomial representations of the Lucas logarithm
• Polynomial representations of the Diffie-Hellman mapping
• Publicly Verifiable Secret Sharing
• A polynomial form for logarithms modulo a prime (Corresp.)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Aitken and Neville Inverse Interpolation Methods over Finite Fields
• A polynomial representation for logarithms in GF(q)
• Transformations of two cryptographic problems in terms of matrices

This page was built for publication: Transformations of Cryptographic Schemes Through Interpolation Techniques