Hackmeeting0x13:Talks: differenze tra le versioni

Vai alla navigazione Vai alla ricerca
(ADDED lattice-based post-quantum cryptograpy)
m (fix)
Riga 19: Riga 19:
| Maz [http://www.mazproject.org/] || Hackeriamo le narrazioni || Presentazione del progetto di narrazioni collettive Maz || Stanza n° || Ora || Giorno n * || [http://lists.autistici.org/message/20160518.202532.50475491.en.html Qui]
| Maz [http://www.mazproject.org/] || Hackeriamo le narrazioni || Presentazione del progetto di narrazioni collettive Maz || Stanza n° || Ora || Giorno n * || [http://lists.autistici.org/message/20160518.202532.50475491.en.html Qui]
|-
|-
| Rakk || Lattice-based Post-Quantum Cryptography || We review the quantum mechanical properties upon which the quantum computational model is based, and shade the differences with the classical Turing machine model. The new computational complexity classes are then studied,
| Rakk
along with quantum algorithms and devoting special care to those which could be employed on quantum computers to carry on efficient attacks on most widespread public-key ciphers used in today’s communications across the internet.
| Lattice-based Post-Quantum Cryptography  
The most important results in post-quantum cryptography are then listed, from seminal ones to a recent lattice-based proposal: a public-key encryption scheme which enjoys both efficient implementation possibilities and a strong security assumption based on a worst-case/average-case reduction. || Stanza n° || Ora || Giorno n * || [http://lists.autistici.org/thread/20160520.134421.d2d8eaef.en.html Qui]
| We review the quantum mechanical properties upon which the quantum computational model is based, and shade the differences with the classical Turing machine model. The new computational complexity classes are then studied, along with quantum algorithms and devoting special care to those which could be employed on quantum computers to carry on efficient attacks on most widespread public-key ciphers used in today’s communications across the internet.
The most important results in post-quantum cryptography are then listed, from seminal ones to a recent lattice-based proposal: a public-key encryption scheme which enjoys both efficient implementation possibilities and a strong security assumption based on a worst-case/average-case reduction.
| Stanza n°  
| Ora
| Giorno n *  
| [http://lists.autistici.org/thread/20160520.134421.d2d8eaef.en.html Qui]
|}
|}
Estratto da "https://wiki.eigenlab.org/Hackmeeting0x13:Talks"