Ricerca

Interessi

• Ottimizzazione del prodotto polinomiale su campi finiti;
• Uso dei constraint solvers per la crittanalisi, usando i formalismi SAT e SMT;
• Crittanalisi differenziale, lineare, troncata e impossibile di cifrari simmetrici.

2024

• A troyan Diffie-Hellman-like protocol based on proof of gullibility
  Michela Ceria, Alessandro De Piccoli, Theo Moriarty, Andrea Visconti
  [Versione automatica del paper]

2023

• Differential Cryptanalysis with SAT, SMT, MILP, and CP: A Detailed Comparison for Bit-Oriented Primitives
  Emanuele Bellini, Alessandro De Piccoli, Mattia Formenti, David Gerault, Paul Huynh, Simone Pelizzola, Sergio Polese, Andrea Visconti
  [Codice basato sulla libreria CLAASP]

2022

• Public key compression and fast polynomial multiplication for NTRU using the corrected hybridized NTT-Karatsuba method
  Rohon Kundu, Alessandro De Piccoli, Andrea Visconti
• New records of pre-image search of reduced SHA-1 using SAT solvers
  Emanuele Bellini, Alessandro De Piccoli, Rusydi Makarim, Sergio Polese, Lorenzo Riva, Andrea Visconti
  Presentato a: ICMC 2021 – 7th International Conference on Mathematics and Computing
  [Codice: Shanatomy]

2021

• Optimizing the key-pair generation phase of McEliece cryptosystem
  Michela Ceria, Alessandro De Piccoli, Martino Tiziani, Andrea Visconti
  Presentato a: WIDECOM – 4th International Conference on Wireless, Intelligent, and Distributed Environment for COMmunication

2019

• Polynomial multiplication over binary finite fields: new upper bounds
  Alessandro De Piccoli, Andrea Visconti, Ottavio Giulio Rizzo
  [Algoritmi di prodotto polinomiale del paper]