Research

Interests

• Optimisation of polynomial product over finite fields;
• Constraint solvers in cryptanalysis, using SAT and SMT formalisms;
• Differential, linear, truncated and impossible cryptanalysis over symmetric ciphers.

2024

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

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
  [Code based on CLAASP library]

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
  Presented at: ICMC 2021 – 7th International Conference on Mathematics and Computing
  [Code: Shanatomy]

2021

• Optimizing the key-pair generation phase of McEliece cryptosystem
  Michela Ceria, Alessandro De Piccoli, Martino Tiziani, Andrea Visconti
  Presented at: 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
  [Straight-line programs from the paper]