Original title: Public-key cryptography and Chebyshev polynomials
Translated title: Public-key cryptography and Chebyshev polynomials
Authors: Appiah, Francis ; Kureš, Miroslav (referee) ; Civino, Roberto (advisor)
Document type: Master’s theses
Year: 2023
Language: eng
Publisher: Vysoké učení technické v Brně. Fakulta strojního inženýrství
Abstract: Public-key encryption enables secure communication over an insecure network. In this thesis, we discuss two public key encryption schemes based on Chebyshev polynomials, which are a class of polynomials that exhibit chaotic properties suitable for cryptographic applications. We discuss that the RSA and ElGamal algorithms are secure, practical, and can be used for encryption. We extend the Chebyshev polynomials over a finite field and demonstrate that the new ElGamal-like and RSA-like algorithms are as secure as the original ElGamal and RSA algorithms.
Keywords: Chaotic maps; Chebyshev polynomials.; ElGamal algorithm; Public key encryption; RSA; Chaotic maps; Chebyshev polynomials.; ElGamal algorithm; Public key encryption; RSA

Institution: Brno University of Technology (web)
Document availability information: Fulltext is available in the Brno University of Technology Digital Library.
Original record: http://hdl.handle.net/11012/212433

Permalink: http://www.nusl.cz/ntk/nusl-530682


The record appears in these collections:
Universities and colleges > Public universities > Brno University of Technology
Academic theses (ETDs) > Master’s theses