Emanuele Bellini

Orcid: 0000-0002-2349-0247

Affiliations:
  • DarkMatter LLC, Abu Dhabi, UAE
  • Telsy Elettronica e Telecomunicazioni S.p.A., Turin, Italy (2014 - 2017)
  • University of Trento, Italy (PhD 2014)


According to our database1, Emanuele Bellini authored at least 52 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2024

Differential cryptanalysis with SAT, SMT, MILP, and CP: a detailed comparison for bit-oriented primitives.
IACR Cryptol. ePrint Arch., 2024

Monte Carlo Tree Search for automatic differential characteristics search: application to SPECK.
IACR Cryptol. ePrint Arch., 2024

2023
Boosting Differential-Linear Cryptanalysis of ChaCha7 with MILP.
IACR Trans. Symmetric Cryptol., 2023

NNBits: Bit Profiling with a Deep Learning Ensemble Based Distinguisher.
IACR Cryptol. ePrint Arch., 2023

ttCryptographicEstimators: a Software Library for Cryptographic Hardness Estimation.
IACR Cryptol. ePrint Arch., 2023

ACE-HoT: Accelerating an extreme amount of symmetric Cipher Evaluations for High-Order avalanche Tests.
IACR Cryptol. ePrint Arch., 2023

Fully Automated Differential-Linear Attacks against ARX Ciphers.
IACR Cryptol. ePrint Arch., 2023

CLAASP: a Cryptographic Library for the Automated Analysis of Symmetric Primitives.
IACR Cryptol. ePrint Arch., 2023

Rotational analysis of ChaCha permutation.
Adv. Math. Commun., 2023

2022
Nonlinearity of Boolean Functions: An Algorithmic Approach Based on Multivariate Polynomials.
Symmetry, 2022

Rotational Cryptanalysis on ChaCha Stream Cipher.
Symmetry, 2022

Hybrid Decoding - Classical-Quantum Trade-Offs for Information Set Decoding.
IACR Cryptol. ePrint Arch., 2022

An Estimator for the Hardness of the MQ Problem.
IACR Cryptol. ePrint Arch., 2022

Functional Cryptanalysis: Application to reduced-round Xoodoo.
IACR Cryptol. ePrint Arch., 2022

A Cipher-Agnostic Neural Training Pipeline with Automated Finding of Good Input Differences.
IACR Cryptol. ePrint Arch., 2022

Parallel Isogeny Path Finding with Limited Memory.
IACR Cryptol. ePrint Arch., 2022

Farasha: A Provable Permutation-based Parallelizable PRF.
IACR Cryptol. ePrint Arch., 2022

MR-DSS - Smaller MinRank-based (Ring-)Signatures.
IACR Cryptol. ePrint Arch., 2022

Practical complexities of probabilistic algorithms for solving Boolean polynomial systems.
Discret. Appl. Math., 2022

Statistical Tests for Symmetric Primitives - An Application to NIST Lightweight Finalists.
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2022

2021
Constant Time Algorithms for ROLLO-I-128.
SN Comput. Sci., 2021

An Optimized Quantum Implementation of ISD on Scalable Quantum Resources.
IACR Cryptol. ePrint Arch., 2021

Syndrome Decoding Estimator.
IACR Cryptol. ePrint Arch., 2021

On the decoding of 1-Fibonacci error correcting codes.
Discret. Math. Algorithms Appl., 2021

Group law on affine conics and applications to cryptography.
Appl. Math. Comput., 2021

Limitations of the Use of Neural Networks in Black Box Cryptanalysis.
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2021

New Records of Pre-image Search of Reduced SHA-1 Using SAT Solvers.
Proceedings of the Seventh International Conference on Mathematics and Computing, 2021

2020
Quantum Search for Scaled Hash Function Preimages.
IACR Cryptol. ePrint Arch., 2020

Performance comparison between deep learning-based and conventional cryptographic distinguishers.
IACR Cryptol. ePrint Arch., 2020

Enhancing Code Based Zero-knowledge Proofs using Rank Metric.
IACR Cryptol. ePrint Arch., 2020

2019
An IND-CCA-Secure Code-Based EncryptionScheme Using Rank Metric.
IACR Cryptol. ePrint Arch., 2019

Rank-metric Encryption on Arm-Cortex M0.
IACR Cryptol. ePrint Arch., 2019

A Multi-factor RSA-like Scheme with Fast Decryption Based on Rédei Rational Functions over the Pell Hyperbola.
Proceedings of the Numerical Computations: Theory and Algorithms, 2019

Improved Veron Identification and Signature Schemes in the Rank Metric.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Advances and Challenges of Rank Metric Cryptography Implementations.
Proceedings of the 37th IEEE International Conference on Computer Design, 2019

Rank-metric Encryption on Arm-Cortex M0: Porting code-based cryptography to lightweight devices.
Proceedings of the 6th on ASIA Public-Key Cryptography Workshop, 2019

An IND-CCA-Secure Code-Based Encryption Scheme Using Rank Metric.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2019, 2019

2018
A deterministic algorithm for the distance and weight distribution of binary nonlinear codes.
Int. J. Inf. Coding Theory, 2018

DRANKULA: a McEliece-like rank metric based cryptosystem implementation.
IACR Cryptol. ePrint Arch., 2018

You Shall Not Pass! (Once Again): An IoT Application of Post-quantum Stateful Signature Schemes.
Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop, 2018

Code-Based Signature Schemes from Identification Protocols in the Rank Metric.
Proceedings of the Cryptology and Network Security - 17th International Conference, 2018

2017
A multifactor RSA-like scheme with fast decryption based on Rédei rational functions over the Pell hyperbola.
CoRR, 2017

2016
An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics.
Finite Fields Their Appl., 2016

An algorithmic approach using multivariate polynomials for the nonlinearity of Boolean functions.
CoRR, 2016

2015
On the Griesmer bound for nonlinear codes.
CoRR, 2015

2014
Computational techniques for nonlinear codes and Boolean functions.
PhD thesis, 2014

Some Bounds on the Size of Codes.
IEEE Trans. Inf. Theory, 2014

Yet another algorithm to compute the nonlinearity of a Boolean function.
CoRR, 2014

2013
An Extension of Cook's Elastic Cipher.
CoRR, 2013

On the Griesmer Bound for Systematic Codes.
CoRR, 2013

2012
A bound on the size of linear codes and systematic codes
CoRR, 2012


  Loading...