Provably Secure Public Key Cryptosystem Based on Chebyshev Polynomials

Journal of Communications - United States
doi 10.12720/jcm.10.6.380-384
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Engineering and Technology Publishing

Related search

Practical Cryptanalysis of a Public Key Cryptosystem Based on the Morphism of Polynomials Problem

Tsinghua Science and Technology
Multidisciplinary
2018English

A Lattice-Based Public-Key Cryptosystem

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
1999English

A Public-Key Cryptosystem Based on Stochastic Petri Net

Journal of Software
2014English

The GH Public-Key Cryptosystem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

A Public Key Cryptosystem Based Upon Euclidean Addition Chains

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

A Public-Key Based Secure Mobile IP

1997English

Counting on Chebyshev Polynomials

Mathematics Magazine
Mathematics
2009English

a Provably Secure Code-Based Concurrent Signature Scheme

IET Information Security
Computer NetworksSoftwareInformation SystemsCommunications
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy