<--- Back to Details
First PageDocument Content
Cryptography / Multivariate cryptography / Equations / Post-quantum cryptography / Quadratic / RSA / QUAD / Algebraic geometry / Algebraic equation / Elliptic Curve Digital Signature Algorithm / Polynomial
Date: 2011-03-20 04:03:34
Cryptography
Multivariate cryptography
Equations
Post-quantum cryptography
Quadratic
RSA
QUAD
Algebraic geometry
Algebraic equation
Elliptic Curve Digital Signature Algorithm
Polynomial

A More Secure and Efficacious TTS Signature Scheme   Jiun-Ming Chen and Bo-Yin Yang

Add to Reading List

Source URL: precision.moscito.org

Download Document from Source Website

File Size: 187,85 KB

Share Document on Facebook

Similar Documents

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

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