default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmanuele Bellini 0002
Person information
- affiliation: DarkMatter LLC, Abu Dhabi, UAE
- affiliation (2014 - 2017): Telsy Elettronica e Telecomunicazioni S.p.A., Turin, Italy
- affiliation (PhD 2014): University of Trento, Italy
Other persons with the same name
- Emanuele Bellini 0001
![[0000-0002-7878-8710]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-7878-8710")
— Roma Tre University, Department of Humanistic Studies, Rome, Italy (and 3 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j15]Emanuele Bellini, Juan Grados, Rusydi H. Makarim, Carlo Sanna:
Finding differential trails on ChaCha by means of state functions. Int. J. Appl. Cryptogr. 4(3/4): 156-175 (2024)- [j14]Gora Adj, Stefano Barbero, Emanuele Bellini, Andre Esser, Luis Rivera-Zamarripa, Carlo Sanna, Javier A. Verbel, Floyd Zweydinger:
MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(2): 304-328 (2024) - [c26]Andre Esser, Javier A. Verbel, Floyd Zweydinger, Emanuele Bellini:
SoK: CryptographicEstimators - a Software Library for Cryptographic Hardness Estimation. AsiaCCS 2024 - [i44]Emanuele Bellini, Alessandro De Piccoli, Mattia Formenti, David Gérault, Paul Huynh, Simone Pelizzola, Sergio Polese, Andrea Visconti:
Differential cryptanalysis with SAT, SMT, MILP, and CP: a detailed comparison for bit-oriented primitives. IACR Cryptol. ePrint Arch. 2024: 105 (2024) - [i43]Emanuele Bellini, David Gérault, Matteo Protopapa, Matteo Rossi:
Monte Carlo Tree Search for automatic differential characteristics search: application to SPECK. IACR Cryptol. ePrint Arch. 2024: 126 (2024) - [i42]Emanuele Bellini, Mattia Formenti, David Gérault, Juan Grados, Anna Hambitzer, Yun Ju Huang, Paul Huynh, Mohamed Rachidi, Raghvendra Rohit, Sharwan K. Tiwari:
CLAASPing ARADI: Automated Analysis of the ARADI Block Cipher. IACR Cryptol. ePrint Arch. 2024: 1324 (2024) - [i41]Emanuele Bellini, Mohamed Rachidi, Raghvendra Rohit, Sharwan K. Tiwari:
Mind the Composition of Toffoli Gates: Structural Algebraic Distinguishers of ARADI. IACR Cryptol. ePrint Arch. 2024: 1559 (2024) - [i40]Emanuele Bellini, David Gérault, Juan Grados, Thomas Peyrin:
The Window Heuristic: Automating Differential Trail Search in ARX Ciphers with Partial Linearization Trade-offs. IACR Cryptol. ePrint Arch. 2024: 1743 (2024) - 2023
- [j13]Stefano Barbero, Emanuele Bellini, Rusydi H. Makarim:
Rotational analysis of ChaCha permutation. Adv. Math. Commun. 17(6): 1422-1439 (2023) - [j12]Emanuele Bellini, David Gérault, Juan Grados, Rusydi H. Makarim, Thomas Peyrin:
Boosting Differential-Linear Cryptanalysis of ChaCha7 with MILP. IACR Trans. Symmetric Cryptol. 2023(2): 189-223 (2023) - [j11]Emanuele Bellini, David Gérault, Anna Hambitzer, Matteo Rossi:
A Cipher-Agnostic Neural Training Pipeline with Automated Finding of Good Input Differences. IACR Trans. Symmetric Cryptol. 2023(3): 184-212 (2023) - [c25]Emanuele Bellini, Alessandro De Piccoli, Mattia Formenti, David Gérault, Paul Huynh, Simone Pelizzola, Sergio Polese, Andrea Visconti:
Differential Cryptanalysis with SAT, SMT, MILP, and CP: A Detailed Comparison for Bit-Oriented Primitives. CANS 2023: 268-292 - [c24]Emanuele Bellini, David Gérault, Juan Grados, Rusydi H. Makarim, Thomas Peyrin:
Fully Automated Differential-Linear Attacks Against ARX Ciphers. CT-RSA 2023: 252-276 - [c23]Anna Hambitzer, David Gérault, Yun Ju Huang, Najwa Aaraj, Emanuele Bellini:
NNBits: Bit Profiling with a Deep Learning Ensemble Based Distinguisher. CT-RSA 2023: 493-523 - [c22]Emanuele Bellini, Juan Grados, Mohamed Rachidi, Nitin Satpute, Joan Daemen, Solane El Hirch:
ACE-HoT: Accelerating an Extreme Amount of Symmetric Cipher Evaluations for (High-order) Avalanche Tests. LATINCRYPT 2023: 24-43 - [c21]Emanuele Bellini, David Gérault, Juan Grados, Yun Ju Huang, Rusydi H. Makarim, Mohamed Rachidi, Sharwan K. Tiwari:
CLAASP: A Cryptographic Library for the Automated Analysis of Symmetric Primitives. SAC 2023: 387-408 - [i39]Emanuele Bellini, David Gérault, Juan Grados, Rusydi H. Makarim, Thomas Peyrin:
Fully Automated Differential-Linear Attacks against ARX Ciphers. IACR Cryptol. ePrint Arch. 2023: 181 (2023) - [i38]Andre Esser, Javier A. Verbel, Floyd Zweydinger, Emanuele Bellini:
ttCryptographicEstimators: a Software Library for Cryptographic Hardness Estimation. IACR Cryptol. ePrint Arch. 2023: 589 (2023) - [i37]Emanuele Bellini, David Gérault, Juan Grados, Yun Ju Huang, Mohamed Rachidi, Sharwan K. Tiwari, Rusydi H. Makarim:
CLAASP: a Cryptographic Library for the Automated Analysis of Symmetric Primitives. IACR Cryptol. ePrint Arch. 2023: 622 (2023) - [i36]Anna Hambitzer, David Gérault, Yun Ju Huang, Najwa Aaraj, Emanuele Bellini:
NNBits: Bit Profiling with a Deep Learning Ensemble Based Distinguisher. IACR Cryptol. ePrint Arch. 2023: 819 (2023) - [i35]Emanuele Bellini, Juan Grados, Mohamed Rachidi, Nitin Satpute, Joan Daemen, Solane El Hirch:
ACE-HoT: Accelerating an extreme amount of symmetric Cipher Evaluations for High-Order avalanche Tests. IACR Cryptol. ePrint Arch. 2023: 1352 (2023) - [i34]Gora Adj, Stefano Barbero, Emanuele Bellini, Andre Esser, Luis Rivera-Zamarripa, Carlo Sanna, Javier A. Verbel, Floyd Zweydinger:
MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head. IACR Cryptol. ePrint Arch. 2023: 1666 (2023) - 2022
- [j10]Stefano Barbero, Emanuele Bellini, Carlo Sanna, Javier A. Verbel:
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems. Discret. Appl. Math. 309: 13-31 (2022) - [j9]Emanuele Bellini, Massimiliano Sala, Ilaria Simonetti:
Nonlinearity of Boolean Functions: An Algorithmic Approach Based on Multivariate Polynomials. Symmetry 14(2): 213 (2022) - [j8]Stefano Barbero, Danilo Bazzanella, Emanuele Bellini:
Rotational Cryptanalysis on ChaCha Stream Cipher. Symmetry 14(6): 1087 (2022) - [c20]Emanuele Bellini, Rusydi H. Makarim, Carlo Sanna, Javier A. Verbel:
An Estimator for the Hardness of the MQ Problem. AFRICACRYPT 2022: 323-347 - [c19]Emanuele Bellini, Jorge Chávez-Saab, Jesús-Javier Chi-Domínguez, Andre Esser, Sorina Ionica, Luis Rivera-Zamarripa, Francisco Rodríguez-Henríquez, Monika Trimoska, Floyd Zweydinger:
Parallel Isogeny Path Finding with Limited Memory. INDOCRYPT 2022: 294-316 - [c18]Emanuele Bellini, David Gérault, Matteo Protopapa, Matteo Rossi:
Monte Carlo Tree Search for Automatic Differential Characteristics Search: Application to SPECK. INDOCRYPT 2022: 373-397 - [c17]Andre Esser, Emanuele Bellini:
Syndrome Decoding Estimator. Public Key Cryptography (1) 2022: 112-141 - [c16]Andre Esser, Sergi Ramos-Calderer, Emanuele Bellini, José I. Latorre, Marc Manzano:
Hybrid Decoding - Classical-Quantum Trade-Offs for Information Set Decoding. PQCrypto 2022: 3-23 - [c15]Emanuele Bellini, Andre Esser, Carlo Sanna, Javier A. Verbel:
MR-DSS - Smaller MinRank-Based (Ring-)Signatures. PQCrypto 2022: 144-169 - [c14]Najwa Aaraj, Emanuele Bellini, Ravindra Jejurikar, Marc Manzano, Raghvendra Rohit, Eugenio Salazar:
Farasha: A Provable Permutation-Based Parallelizable PRF. SAC 2022: 437-458 - [c13]Emanuele Bellini, Yun Ju Huang, Mohamed Rachidi:
Statistical Tests for Symmetric Primitives - An Application to NIST Lightweight Finalists. SecITC 2022: 133-152 - [e1]Alastair R. Beresford, Arpita Patra, Emanuele Bellini:
Cryptology and Network Security - 21st International Conference, CANS 2022, Dubai, United Arab Emirates, November 13-16, 2022, Proceedings. Lecture Notes in Computer Science 13641, Springer 2022, ISBN 978-3-031-20973-4 [contents] - [i33]Emanuele Bellini, Rusydi H. Makarim:
Functional Cryptanalysis: Application to reduced-round Xoodoo. IACR Cryptol. ePrint Arch. 2022: 134 (2022) - [i32]Emanuele Bellini, Rusydi H. Makarim, Carlo Sanna, Javier A. Verbel:
An Estimator for the Hardness of the MQ Problem. IACR Cryptol. ePrint Arch. 2022: 708 (2022) - [i31]Andre Esser, Sergi Ramos-Calderer, Emanuele Bellini, José Ignacio Latorre, Marc Manzano:
Hybrid Decoding - Classical-Quantum Trade-Offs for Information Set Decoding. IACR Cryptol. ePrint Arch. 2022: 964 (2022) - [i30]Emanuele Bellini, Andre Esser, Carlo Sanna, Javier A. Verbel:
MR-DSS - Smaller MinRank-based (Ring-)Signatures. IACR Cryptol. ePrint Arch. 2022: 973 (2022) - [i29]Najwa Aaraj, Emanuele Bellini, Ravindra Jejurikar, Marc Manzano, Raghvendra Rohit, Eugenio Salazar:
Farasha: A Provable Permutation-based Parallelizable PRF. IACR Cryptol. ePrint Arch. 2022: 1150 (2022) - [i28]Emanuele Bellini, Jorge Chávez-Saab, Jesús-Javier Chi-Domínguez, Andre Esser, Sorina Ionica, Luis Rivera-Zamarripa, Francisco Rodríguez-Henríquez, Monika Trimoska, Floyd Zweydinger:
Parallel Isogeny Path Finding with Limited Memory. IACR Cryptol. ePrint Arch. 2022: 1464 (2022) - [i27]Emanuele Bellini, David Gérault, Anna Hambitzer, Matteo Rossi:
A Cipher-Agnostic Neural Training Pipeline with Automated Finding of Good Input Differences. IACR Cryptol. ePrint Arch. 2022: 1467 (2022) - 2021
- [j7]Emanuele Bellini, Nadir Murru, Antonio J. Di Scala, Michele Elia:
Group law on affine conics and applications to cryptography. Appl. Math. Comput. 409: 125537 (2021) - [j6]Emanuele Bellini, Chiara Marcolla, Nadir Murru:
On the decoding of 1-Fibonacci error correcting codes. Discret. Math. Algorithms Appl. 13(5): 2150056:1-2150056:18 (2021) - [j5]Sergi Ramos-Calderer, Emanuele Bellini, José I. Latorre, Marc Manzano, Víctor Mateu:
Quantum search for scaled hash function preimages. Quantum Inf. Process. 20(5): 180 (2021) - [j4]Carlos Aguilar Melchor, Nicolas Aragon, Emanuele Bellini, Florian Caullery, Rusydi H. Makarim, Chiara Marcolla:
Constant Time Algorithms for ROLLO-I-128. SN Comput. Sci. 2(5): 382 (2021) - [c12]Emanuele Bellini, Alessandro De Piccoli, Rusydi H. Makarim, Sergio Polese, Lorenzo Riva, Andrea Visconti:
New Records of Pre-image Search of Reduced SHA-1 Using SAT Solvers. ICMC 2021: 141-151 - [c11]Emanuele Bellini, Matteo Rossi:
Performance Comparison Between Deep Learning-Based and Conventional Cryptographic Distinguishers. SAI (3) 2021: 681-701 - [c10]Emanuele Bellini, Anna Hambitzer, Matteo Protopapa, Matteo Rossi:
Limitations of the Use of Neural Networks in Black Box Cryptanalysis. SecITC 2021: 100-124 - [i26]Andre Esser, Sergi Ramos-Calderer, Emanuele Bellini, José I. Latorre, Marc Manzano:
An Optimized Quantum Implementation of ISD on Scalable Quantum Resources. CoRR abs/2112.06157 (2021) - [i25]Stefano Barbero, Emanuele Bellini, Carlo Sanna, Javier A. Verbel:
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems. IACR Cryptol. ePrint Arch. 2021: 913 (2021) - [i24]Andre Esser, Emanuele Bellini:
Syndrome Decoding Estimator. IACR Cryptol. ePrint Arch. 2021: 1243 (2021) - [i23]Andre Esser, Sergi Ramos-Calderer, Emanuele Bellini, José I. Latorre, Marc Manzano:
An Optimized Quantum Implementation of ISD on Scalable Quantum Resources. IACR Cryptol. ePrint Arch. 2021: 1608 (2021) - 2020
- [c9]Emanuele Bellini, Philippe Gaborit, Alexandros Hasikos, Víctor Mateu:
Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric. CANS 2020: 570-592 - [i22]Emanuele Bellini, Chiara Marcolla, Nadir Murru:
On the decoding of 1-Fibonacci error correcting codes. CoRR abs/2003.12991 (2020) - [i21]Stefano Barbero, Emanuele Bellini, Rusydi H. Makarim:
Rotational analysis of ChaCha permutation. CoRR abs/2008.13406 (2020) - [i20]Sergi Ramos-Calderer, Emanuele Bellini, José I. Latorre, Marc Manzano, Víctor Mateu:
Quantum Search for Scaled Hash Function Preimages. CoRR abs/2009.00621 (2020) - [i19]Emanuele Bellini, Matteo Rossi:
Performance comparison between deep learning-based and conventional cryptographic distinguishers. IACR Cryptol. ePrint Arch. 2020: 953 (2020) - [i18]Stefano Barbero, Emanuele Bellini, Rusydi H. Makarim:
Rotational analysis of ChaCha permutation. IACR Cryptol. ePrint Arch. 2020: 1049 (2020) - [i17]Sergi Ramos-Calderer, Emanuele Bellini, José I. Latorre, Marc Manzano, Víctor Mateu:
Quantum Search for Scaled Hash Function Preimages. IACR Cryptol. ePrint Arch. 2020: 1062 (2020) - [i16]Carlos Aguilar Melchor, Nicolas Aragon, Emanuele Bellini, Florian Caullery, Rusydi H. Makarim, Chiara Marcolla:
Constant time algorithms for ROLLO-I-128. IACR Cryptol. ePrint Arch. 2020: 1066 (2020) - [i15]Emanuele Bellini, Philippe Gaborit, Alexandros Hasikos, Víctor Mateu:
Enhancing Code Based Zero-knowledge Proofs using Rank Metric. IACR Cryptol. ePrint Arch. 2020: 1472 (2020)
2010 – 2019
- 2019
- [c8]Hamad Al Shehhi, Emanuele Bellini, Filipe Borba, Florian Caullery, Marc Manzano, Víctor Mateu:
An IND-CCA-Secure Code-Based Encryption Scheme Using Rank Metric. AFRICACRYPT 2019: 79-96 - [c7]Ameera Salem Al Abdouli, Emanuele Bellini, Florian Caullery, Marcos Manzano, Víctor Mateu:
Rank-metric Encryption on Arm-Cortex M0: Porting code-based cryptography to lightweight devices. APKC@AsiaCCS 2019: 23-30 - [c6]Emanuele Bellini, Florian Caullery, Rusydi H. Makarim, Marc Manzano, Chiara Marcolla, Víctor Mateu:
Advances and Challenges of Rank Metric Cryptography Implementations. ICCD 2019: 325-328 - [c5]Emanuele Bellini, Florian Caullery, Philippe Gaborit, Marc Manzano, Víctor Mateu:
Improved Veron Identification and Signature Schemes in the Rank Metric. ISIT 2019: 1872-1876 - [c4]Emanuele Bellini, Nadir Murru:
A Multi-factor RSA-like Scheme with Fast Decryption Based on Rédei Rational Functions over the Pell Hyperbola. NUMTA(1) 2019: 343-357 - [i14]Emanuele Bellini, Florian Caullery, Philippe Gaborit, Marc Manzano, Víctor Mateu:
Improved Veron Identification and Signature Schemes in the Rank Metric. CoRR abs/1903.10212 (2019) - [i13]Ameera Salem Al Abdouli, Emanuele Bellini, Florian Caullery, Marcos Manzano, Víctor Mateu:
Rank-metric Encryption on Arm-Cortex M0. IACR Cryptol. ePrint Arch. 2019: 1274 (2019) - [i12]Hamad Al Shehhi, Emanuele Bellini, Filipe Borba, Florian Caullery, Marc Manzano, Víctor Mateu:
An IND-CCA-Secure Code-Based EncryptionScheme Using Rank Metric. IACR Cryptol. ePrint Arch. 2019: 1278 (2019) - 2018
- [j3]Emanuele Bellini, Massimiliano Sala:
A deterministic algorithm for the distance and weight distribution of binary nonlinear codes. Int. J. Inf. Coding Theory 5(1): 18-35 (2018) - [c3]Emanuele Bellini, Florian Caullery, Alexandros Hasikos, Marc Manzano, Víctor Mateu:
Code-Based Signature Schemes from Identification Protocols in the Rank Metric. CANS 2018: 277-298 - [c2]Emanuele Bellini, Florian Caullery, Alexandros Hasikos, Marc Manzano, Víctor Mateu:
You Shall Not Pass! (Once Again): An IoT Application of Post-quantum Stateful Signature Schemes. APKC@AsiaCCS 2018: 19-24 - [c1]Ameera Salem Al Abdouli, Mohamed Al Ali, Emanuele Bellini, Florian Caullery, Alexandros Hasikos, Marc Manzano, Víctor Mateu:
DRANKULA: A McEliece-like Rank Metric based Cryptosystem Implementation. ICETE (2) 2018: 230-241 - [i11]Ameera Salem Al Abdouli, Mohamed Al Ali, Emanuele Bellini, Florian Caullery, Alexandros Hasikos, Marc Manzano, Víctor Mateu:
DRANKULA: a McEliece-like rank metric based cryptosystem implementation. IACR Cryptol. ePrint Arch. 2018: 768 (2018) - 2017
- [i10]Emanuele Bellini, Nadir Murru:
A multifactor RSA-like scheme with fast decryption based on Rédei rational functions over the Pell hyperbola. CoRR abs/1709.00696 (2017) - 2016
- [j2]Emanuele Bellini, Nadir Murru:
An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics. Finite Fields Their Appl. 39: 179-194 (2016) - [i9]Emanuele Bellini, Teo Mora, Massimiliano Sala:
An algorithmic approach using multivariate polynomials for the nonlinearity of Boolean functions. CoRR abs/1610.05932 (2016) - 2015
- [i8]Emanuele Bellini, Eleonora Guerrini, Alessio Meneghetti, Massimiliano Sala:
On the Griesmer bound for nonlinear codes. CoRR abs/1502.07379 (2015) - [i7]Emanuele Bellini, Massimiliano Sala:
A deterministic algorithm for the distance and weight distribution of binary nonlinear codes. CoRR abs/1505.00542 (2015) - [i6]Emanuele Bellini, Nadir Murru:
An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics. CoRR abs/1511.03451 (2015) - 2014
- [b1]Emanuele Bellini:
Computational techniques for nonlinear codes and Boolean functions. University of Trento, Italy, 2014 - [j1]Emanuele Bellini, Eleonora Guerrini, Massimiliano Sala:
Some Bounds on the Size of Codes. IEEE Trans. Inf. Theory 60(3): 1475-1480 (2014) - [i5]Emanuele Bellini:
Yet another algorithm to compute the nonlinearity of a Boolean function. CoRR abs/1404.2471 (2014) - [i4]Emanuele Bellini, Ilaria Simonetti, Massimiliano Sala:
Nonlinearity of Boolean functions: an algorithmic approach based on multivariate polynomials. CoRR abs/1404.2741 (2014) - 2013
- [i3]Emanuele Bellini, Guglielmo Morgari, Marco Coppola:
An Extension of Cook's Elastic Cipher. CoRR abs/1310.4050 (2013) - [i2]Emanuele Bellini:
On the Griesmer Bound for Systematic Codes. CoRR abs/1310.4060 (2013) - 2012
- [i1]Eleonora Guerrini, Emanuele Bellini, Massimiliano Sala:
A bound on the size of linear codes and systematic codes. CoRR abs/1206.6006 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 22:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
