<--- Back to Details
First PageDocument Content
Finite fields / Niels Henrik Abel / Elliptic curve cryptography / Elliptic curve / RSA / Abelian group / Quantum computer / Hyperelliptic curve cryptography / XTR / Cryptography / Abstract algebra / Public-key cryptography
Date: 2013-06-06 03:19:35
Finite fields
Niels Henrik Abel
Elliptic curve cryptography
Elliptic curve
RSA
Abelian group
Quantum computer
Hyperelliptic curve cryptography
XTR
Cryptography
Abstract algebra
Public-key cryptography

Slide 1 [removed]Slide 1

Add to Reading List

Source URL: ec.europa.eu

Download Document from Source Website

File Size: 847,33 KB

Share Document on Facebook

Similar Documents

Cryptography / Mathematics / Algebra / Finite fields / Computational hardness assumptions / Integer factorization algorithms / Emerging technologies / Quantum computing / RSA / Euclidean algorithm / Quantum algorithm / XTR

Lecture 19, Thurs March 30: RSA and Shor’s Algorithm Today we’ll see Shor’s algorithm. Given a positive integer ​N​, which we’ll assume for simplicity is a product of two primes |​and , this algorithm lets

DocID: 1xVSj - View Document

PDF Document

DocID: 1xRwQ - View Document

PDF Document

DocID: 1xu6k - View Document

PDF Document

DocID: 1x9q3 - View Document

PDF Document

DocID: 1x1dn - View Document