2006•Shuxue de shijian yu renshiRequires access

Quantum Computing And Public-Key Cryptograpgy

Zhiguo Du

Open publisher page 0 citations

Abstract

In this paper,we introduced the Peter Shor′s algorithm.Then,we applied it to attacking several kinds of public-key cryptography such as RSA which is based on integer factoring hard problem,and ELGamal,ECC which are based on discrete logarithm hard problem.

About this research paper

What this paper is about

In this paper,we introduced the Peter Shor′s algorithm.Then,we applied it to attacking several kinds of public-key cryptography such as RSA which is based on integer factoring hard problem,and ELGamal,ECC which are based on discrete logarithm hard problem.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper,we introduced the Peter Shor′s algorithm.Then,we applied it to attacking several kinds of public-key cryptography such as RSA which is based on integer factoring hard problem,and ELGamal,ECC which are based on discrete logarithm hard problem.

Key concepts: ElGamal encryption, Discrete logarithm, Public-key cryptography, Post-quantum cryptography, Key (lock), Factoring, Cryptography, Public key cryptosystem

Related papers

Back to paper searchBrowse research topicsOriginal source
Quantum Computing And Public-Key Cryptograpgy — Research Paper | ScholarLens