國立虎尾科技大學 |

Post-Quantum Cryptography with Quasi-Cyclic Moderate-Density Parity-Check Codes.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Post-Quantum Cryptography with Quasi-Cyclic Moderate-Density Parity-Check Codes./
作者:	De Ree, Marcus.
面頁冊數:	1 online resource (83 pages)
附註:	Source: Masters Abstracts International, Volume: 57-01.
Contained By:	Masters Abstracts International57-01(E).
標題:	Applied mathematics. -
電子資源:	click for full text (PQDT)
ISBN:	9780355247725

Post-Quantum Cryptography with Quasi-Cyclic Moderate-Density Parity-Check Codes.
De Ree, Marcus.

Post-Quantum Cryptography with Quasi-Cyclic Moderate-Density Parity-Check Codes. - 1 online resource (83 pages)

Source: Masters Abstracts International, Volume: 57-01.

Thesis (M.S.)

Includes bibliographical references

The purpose of this thesis is to examine if Quasi-Cyclic Moderate-Density Parity-Check (QC-MDPC) codes is a good family of error-correcting codes to replace the family of Goppa codes in the McEliece cryptosystem. This cryptosystem is one of a few cryptosystems which are thought to be secure against all-purpose quantum computers.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780355247725Subjects--Topical Terms:

1069907
Applied mathematics.
Index Terms--Genre/Form:

554714
Electronic books.

Post-Quantum Cryptography with Quasi-Cyclic Moderate-Density Parity-Check Codes.
LDR:03219ntm a2200373Ki 4500 001 910965
005 20180517120325.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9780355247725
035 $a (MiAaPQ)AAI10633664
035 $a (MiAaPQ)sdsu:11786
035 $a AAI10633664
040 $a MiAaPQ $b eng $c MiAaPQ
099 $a TUL $f hyy $c available through World Wide Web
100 1 $a De Ree, Marcus. $3 1182519
245 1 0 $a Post-Quantum Cryptography with Quasi-Cyclic Moderate-Density Parity-Check Codes.
264 0 $c 2017
300 $a 1 online resource (83 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Masters Abstracts International, Volume: 57-01.
500 $a Adviser: J. Carmelo INTERLANDO.
502 $a Thesis (M.S.) $c San Diego State University $d 2017.
504 $a Includes bibliographical references
520 $a The purpose of this thesis is to examine if Quasi-Cyclic Moderate-Density Parity-Check (QC-MDPC) codes is a good family of error-correcting codes to replace the family of Goppa codes in the McEliece cryptosystem. This cryptosystem is one of a few cryptosystems which are thought to be secure against all-purpose quantum computers.
520 $a Cryptographic techniques have been used to provide secure communication between users since classical times. However, advances in the field of quantum physics and quantum computing might give rise to all-purpose quantum computers within the next decade. These quantum computers are able to exploit properties from its core components, the quantum bits, to solve some of the hardest mathematical problems. However, these unsolvable problems grant current day encryptions its security. Some cryptosystems are found to be resistant against the power of quantum computers. One of which was proposed in 1978 by Robert McEliece. He proposed a cryptosystem based on techniques used in coding theory. Despite allowing for the rapid encryption and decryption of messages, storage of the users' cryptographic key requires a large amount of memory, making its use impractical. Many professionals from the fields of mathematics, computer science and engineering have proposed changes to decrease the size of the key. So far, all these propositions have led to either a security breach or were found inefficient. The family of QC-MDPC codes has been coined to replace Goppa codes in the McEliece cryptosystem. These codes also allow for rapid encryption and decryption, but has the additional advantage that storage of its cryptographic key requires significantly less memory.
520 $a This study shows that, like a lot of other families of codes, QC-MDPC codes is also vulnerable to a key-breaking cryptanalytic attack which excludes them from being a candidate to replace the originally proposed Goppa codes.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Applied mathematics. $3 1069907
650 4 $a Computer science. $3 573171
655 7 $a Electronic books. $2 local $3 554714
690 $a 0364
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a San Diego State University. $b Applied Mathematics. $3 1182520
773 0 $t Masters Abstracts International $g 57-01(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10633664 $z click for full text (PQDT)