□ The Emergence of a Quantum Computer
-Public-key signature schemes provide authentication integrity and non repudiation. Today, digital signatures provide authenticity
proofs for billions of software downloads daily on the Internet. The security of widely used signature schemes such as RSA, DSA and ECDSA is based on
the hardness of integer factoring problem (IFP) and the (elliptic curve) discrete logarithm problem (DLP), respectively.
-However, with Shor's algorithm, a sufficiently large quantum computer can solve these problems
in polynomial time that entirely break their corresponding schemes. Thus, it is important to investigate possible alternatives, practical public-key cryptographic algorithms based mathematical hard problems secure against a Quantum Computer.
-The definition of Post-Quantum Cryptography is public-key (asymmetric) cryptography that resists attacks using
classical and quantum computers.
□ Development of public-key digital signature algorithms based mathematical hard problems secure against a Quantum Computer.
- High-speed Digital signature algorithms based on multivariate quadratic problem
∙ A high-speed Digital signature algorithm for 8-bit low-cost devices
∙ A high-speed Digital signature algorithm with fast signature generation
∙ A high-speed Digital signature algorithm with fast verification
∙ A high-speed Digital signature algorithm for 8-bit low-cost devices
Address : 70, Yuseong-daero 1689 beon-gil, Yuseong-gu, Daejeon, 34047, Korea
Website : http://www.nims.re.kr