Emanuele Bellini

Alessandro De Piccoli

IACR Cryptol. ePrint Arch., 2024

Monte Carlo Tree Search for automatic differential characteristics search: application to SPECK.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

The Window Heuristic: Automating Differential Trail Search in ARX Ciphers with Partial Linearization Trade-offs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

CLAASPing ARADI: Automated Analysis of the ARADI Block Cipher.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

SoK: CryptographicEstimators - a Software Library for Cryptographic Hardness Estimation.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, 2024

2023

A Cipher-Agnostic Neural Training Pipeline with Automated Finding of Good Input Differences.

[BibT_eX]

[DOI]

IACR Trans. Symmetric Cryptol., 2023

Boosting Differential-Linear Cryptanalysis of ChaCha7 with MILP.

[BibT_eX]

[DOI]

IACR Trans. Symmetric Cryptol., 2023

NNBits: Bit Profiling with a Deep Learning Ensemble Based Distinguisher.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

ttCryptographicEstimators: a Software Library for Cryptographic Hardness Estimation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

ACE-HoT: Accelerating an extreme amount of symmetric Cipher Evaluations for High-Order avalanche Tests.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Fully Automated Differential-Linear Attacks against ARX Ciphers.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

CLAASP: a Cryptographic Library for the Automated Analysis of Symmetric Primitives.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Rotational analysis of ChaCha permutation.

[BibT_eX]

[DOI]

Stefano Barbero

Rusydi H. Makarim

Adv. Math. Commun., 2023

2022

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

[BibT_eX]

[DOI]

Ilaria Simonetti

Symmetry, 2022

Rotational Cryptanalysis on ChaCha Stream Cipher.

[BibT_eX]

[DOI]

Stefano Barbero

Danilo Bazzanella

Symmetry, 2022

Hybrid Decoding - Classical-Quantum Trade-Offs for Information Set Decoding.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

An Estimator for the Hardness of the MQ Problem.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Functional Cryptanalysis: Application to reduced-round Xoodoo.

[BibT_eX]

[DOI]

Rusydi H. Makarim

IACR Cryptol. ePrint Arch., 2022

Parallel Isogeny Path Finding with Limited Memory.

[BibT_eX]

[DOI]

Jesús-Javier Chi-Domínguez

Jorge Chávez-Saab

Andre Esser

Sorina Ionica

Luis Rivera-Zamarripa

Francisco Rodríguez-Henríquez

Monika Trimoska

Floyd Zweydinger

IACR Cryptol. ePrint Arch., 2022

Farasha: A Provable Permutation-based Parallelizable PRF.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

MR-DSS - Smaller MinRank-based (Ring-)Signatures.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Practical complexities of probabilistic algorithms for solving Boolean polynomial systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Statistical Tests for Symmetric Primitives - An Application to NIST Lightweight Finalists.

[BibT_eX]

[DOI]

Yun Ju Huang

Mohamed Rachidi

Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2022

2021

Constant Time Algorithms for ROLLO-I-128.

[BibT_eX]

[DOI]

Carlos Aguilar Melchor

SN Comput. Sci., 2021

Quantum search for scaled hash function preimages.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2021

An Optimized Quantum Implementation of ISD on Scalable Quantum Resources.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Syndrome Decoding Estimator.

[BibT_eX]

[DOI]

Andre Esser

IACR Cryptol. ePrint Arch., 2021

On the decoding of 1-Fibonacci error correcting codes.

[BibT_eX]

[DOI]

Chiara Marcolla

Discret. Math. Algorithms Appl., 2021

Group law on affine conics and applications to cryptography.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2021

Limitations of the Use of Neural Networks in Black Box Cryptanalysis.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Alessandro De Piccoli

Proceedings of the Seventh International Conference on Mathematics and Computing, 2021

2020

Performance comparison between deep learning-based and conventional cryptographic distinguishers.

[BibT_eX]

[DOI]

Matteo Rossi

IACR Cryptol. ePrint Arch., 2020

Enhancing Code Based Zero-knowledge Proofs using Rank Metric.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

2019

An IND-CCA-Secure Code-Based EncryptionScheme Using Rank Metric.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Rank-metric Encryption on Arm-Cortex M0.

[BibT_eX]

[DOI]

Ameera Salem Al Abdouli

IACR Cryptol. ePrint Arch., 2019

A Multi-factor RSA-like Scheme with Fast Decryption Based on Rédei Rational Functions over the Pell Hyperbola.

[BibT_eX]

[DOI]

Proceedings of the Numerical Computations: Theory and Algorithms, 2019

Improved Veron Identification and Signature Schemes in the Rank Metric.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Advances and Challenges of Rank Metric Cryptography Implementations.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Ameera Salem Al Abdouli

Proceedings of the 6th on ASIA Public-Key Cryptography Workshop, 2019

An IND-CCA-Secure Code-Based Encryption Scheme Using Rank Metric.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - AFRICACRYPT 2019, 2019

2018

A deterministic algorithm for the distance and weight distribution of binary nonlinear codes.

[BibT_eX]

[DOI]

Int. J. Inf. Coding Theory, 2018

DRANKULA: a McEliece-like rank metric based cryptosystem implementation.

[BibT_eX]

[DOI]

Ameera Salem Al Abdouli

IACR Cryptol. ePrint Arch., 2018

You Shall Not Pass! (Once Again): An IoT Application of Post-quantum Stateful Signature Schemes.

[BibT_eX]

[DOI]

Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop, 2018

Code-Based Signature Schemes from Identification Protocols in the Rank Metric.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

CoRR, 2017

2016

An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2016

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

[BibT_eX]

[DOI]

Teo Mora

CoRR, 2016

2015

On the Griesmer bound for nonlinear codes.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Computational techniques for nonlinear codes and Boolean functions.

[BibT_eX]

[DOI]

PhD thesis, 2014

Some Bounds on the Size of Codes.

[BibT_eX]

[DOI]

Eleonora Guerrini

IEEE Trans. Inf. Theory, 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

2013

An Extension of Cook's Elastic Cipher.

[BibT_eX]

[DOI]

Guglielmo Morgari

Marco Coppola

CoRR, 2013

On the Griesmer Bound for Systematic Codes.

[BibT_eX]

[DOI]

CoRR, 2013

2012

A bound on the size of linear codes and systematic codes

[BibT_eX]

[DOI]

Eleonora Guerrini