Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Electrical Engineering / 電機工程學系
  4. Quantum Algorithms and its Application in Cryptography
 
  • Details

Quantum Algorithms and its Application in Cryptography

Date Issued
2005-07-31
Date
2005-07-31
Author(s)
雷欽隆  
DOI
932218E002103
URI
http://ntur.lib.ntu.edu.tw//handle/246246/8054
Abstract
Even since the introduction of quantum
computation to the computing world, many
practical quantum experiments have been
successfully carried out. By taking advantage
of the tremendous computing power of
quantum computers, Peter Shor has shown
that factor large numbers can be done in
polynomial time. Public key cryptosystems,
digital signature schemes as well as many
other schemes that depended on this
difficulty of factoring large numbers would
become vulnerable. On the other hand,perfect secure cryptographic key distribution
scheme based on quantum computing has
been developed. Indeed, quantum computing
will threaten the security of many classical
cryptographic schemes, but it can also make
classically infeasible computing tasks
become feasible. Quantum computing has
attracts the attentions of most leading
scholars and research institute in the world.
The main research targets of this project
are quantum automata theory, quantum
algorithms and quantum cryptography. By
studying the theoretical foundations of
quantum computing, we hope we can have a
better understanding of the power of
quantum computing and can design practical
and effective quantum algorithms. In
particular, we shall focus on what classically
infeasible cryptographic tasks might become
feasible using quantum computers. For
example, can we break AES (Advanced
Encryption Standard) efficiently using
quantum computers? We still do not know.
In particular, can we solve any NP-hard
problem with polynomial-time quantum
computation? (I.e., is NP a subset of QP?)
Next, we are also interested in what new
quantum objects might be created and
adopted to construct secure cryptographic
protocols that are impossible using classical
computation models.
We will investigate the possibility of
adopting quantum parallelism for fast
cryptanalysis. We will also study the
possibility of adopting the non-cloning
feature of quantum objects to design efficient
algorithms for quantum money. In addition,
we shall study what other quantum
phenomena (such as superposition,
entanglement, reversibility, etc.) might be
useful for quantum algorithm design. Under
this project, we expect to integrate the
research potential in the nation and
collaborate with leading researchers in the
world.
Subjects
Quantum Computing
Quantum
Algorithm
Quantum Automata
Quantum
Cryptography
Publisher
臺北市:國立臺灣大學電機工程學系暨研究所
Type
report
File(s)
Loading...
Thumbnail Image
Name

932218E002103.pdf

Size

148.24 KB

Format

Adobe PDF

Checksum

(MD5):c64f21090eb96b91f0e2dbe5e3edb0e6

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science