Quantum Secure Networks 合作伙伴关系最新进展.pdf

1、IakiBarettini,QSNP Innovation ManagerQSNP.The European Initiative for the Development of Quantum-Safe NetworksCryptography is under threatQuantum Computers could break most of todays secure infrastructures(Public Key Cryptography)There is an urgent need for Quantum-Safe SystemsTo protect sensitive d

2、ata from the“Harvest now,decrypt later”attacks(“MoscasTheorem”)The Shors algorithm breaks asymmetric cryptography;The Grovers algorithm weakens symmetric cryptographyShors shrinks complexity in prime number factorization from exponential to polynomial while Grovers reduces item search on a list from

3、 N to N calculationsThe Problem:Cryptography under threatx=Migration Time(3 years)y=Retention Period(12 years)z=Time to Build Quantum Computer(10 years)Classical cryptography based on mathematical complex functionsOne way functionsEasy in one direction(verification)Difficult in the reverse direction

4、(decipher)Example:Prime number factorization7x5=3535=P x Q?23X31=713 713=?733 x 1,031=755,723755,723=?Given the input,functions output is easy to calculateGiven the output,finding the input is almost impossibleAs numbers get larger complexity increases exponentially Key exchange protocols and digita

5、l signatures based on these principlesClassical CryptographyClassical Crypto based on mathematical algorithmsInteger factorization(RSA)Discrete logarithms:over finite fields(Diffie-Hellman)and generalizations(Elliptic curves ECDH,ECDSA)Post Quantum Crypto(PQC)also based on mathematical principlesNIS

6、T contest 2016-2025 for standardization looked into several families of PQC algorithms that are resistant to Shors algorithm3 Standards approved in 2025:FIPS 203&204(Lattice problem for Key Encapsulation and Digital Signature)and FIPS 205(Hash based for signature)Chrystal Khyber,Chrystal Dilithium,F