Massimiliano Sala

Orcid: 0000-0002-7266-5146

Affiliations:
  • University of Trento, Italy
  • University College Cork, Ireland (2002 - 2006)
  • University of Milan, Italy (PhD 2001)


According to our database1, Massimiliano Sala authored at least 86 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On cryptographic properties of cubic and splitting Boolean functions.
Appl. Algebra Eng. Commun. Comput., September, 2024

Group structure of elliptic curves over ℤ/Nℤ.
J. Math. Cryptol., February, 2024

Searchable encryption with randomized ciphertext and randomized keyword search.
J. Math. Cryptol., February, 2024

A Note on Vectorial Boolean Functions as Embeddings.
CoRR, 2024

An algebraic attack on stream ciphers with application to nonlinear filter generators and WG-PRNG.
Adv. Math. Commun., 2024

2023
A coercion-resistant blockchain-based E-voting protocol with receipts.
Adv. Math. Commun., 2023

A survey on functional encryption.
Adv. Math. Commun., 2023

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

A formula on the weight distribution of linear codes with applications to AMDS codes.
Finite Fields Their Appl., 2022

2021
On explicit reductions between two purely algebraic problems: MQ and MLD.
CoRR, 2021

Rational points on cubic surfaces and AG codes from the Norm-Trace curve.
CoRR, 2021

2020
Coercion-Resistant Blockchain-Based E-Voting Protocol.
IACR Cryptol. ePrint Arch., 2020

Threshold Multi-Signature with an Offline Recovery Party.
IACR Cryptol. ePrint Arch., 2020

Intersections between the norm-trace curve and some low degree curves.
Finite Fields Their Appl., 2020

A Provably-Unforgeable Threshold EdDSA with an Offline Recovery Party.
CoRR, 2020

Threshold ECDSA with an Offline Recovery Party.
CoRR, 2020

On the linear structures of balanced functions and quadratic APN functions.
Cryptogr. Commun., 2020

HELP: a sparse error locator polynomial for BCH codes.
Appl. Algebra Eng. Commun. Comput., 2020

A Note on an ECDLP-based PoW Model.
Proceedings of the 3rd Distributed Ledger Technology Workshop Co-located with ITASEC 2020, 2020

2019
Public Ledger for Sensitive Data.
IACR Cryptol. ePrint Arch., 2019

Weight distribution of Hermitian codes and matrices rank.
Finite Fields Their Appl., 2019

On hidden sums compatible with a given block cipher diffusion layer.
Discret. Math., 2019

Differential attacks: using alternative operations.
Des. Codes Cryptogr., 2019

A new ECDLP-based PoW model.
CoRR, 2019

On some cryptographic properties of Boolean functions and their second-order derivatives.
CoRR, 2019

A survey on efficient parallelization of blockchain-based smart contracts.
CoRR, 2019

Wave-shaped round functions and primitive groups.
Adv. Math. Commun., 2019

Two-tier blockchain timestamped notarization with incremental security.
Proceedings of the Second Distributed Ledger Technology Workshop, 2019

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

On the discrete logarithm problem for prime-field elliptic curves.
Finite Fields Their Appl., 2018

Hilbert quasi-polynomial for order domains and application to coding theory.
Adv. Math. Commun., 2018

2017
On the Shape of the General Error Locator Polynomial for Cyclic Codes.
IEEE Trans. Inf. Theory, 2017

Code generator matrices as RNG conditioners.
Finite Fields Their Appl., 2017

A note on APN permutations in even dimension.
Finite Fields Their Appl., 2017

Generalised Round Functions for Block Ciphers and their Security.
CoRR, 2017

Several proofs of security for a tokenization algorithm.
Appl. Algebra Eng. Commun. Comput., 2017

On the security of the blockchain BIX protocol and certificates.
Proceedings of the 9th International Conference on Cyber Conflict, 2017

2016
On Optimal Nonlinear Systematic Codes.
IEEE Trans. Inf. Theory, 2016

On the small-weight codewords of some Hermitian codes.
J. Symb. Comput., 2016

Collaborative Multi-Authority KP-ABE for Shorter Keys and Parameters.
IACR Cryptol. ePrint Arch., 2016

A discrete logarithm-based approach to compute low-weight multiples of binary polynomials.
Finite Fields Their Appl., 2016

Hilbert quasi-polynomial for order domain codes.
CoRR, 2016

A proof of security for a key-policy RS-ABE scheme.
CoRR, 2016

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

On weak differential uniformity of vectorial Boolean functions as a cryptographic criterion.
Appl. Algebra Eng. Commun. Comput., 2016

2015
Code generator matrices as entropy extractors.
CoRR, 2015

On the Griesmer bound for nonlinear codes.
CoRR, 2015

Attacking BEAR and LION Schemes in a Realistic Scenario.
Proceedings of the Algebraic Informatics - 6th International Conference, 2015

Key-Policy Multi-authority Attribute-Based Encryption.
Proceedings of the Algebraic Informatics - 6th International Conference, 2015

On Differential Uniformity of Maps that May Hide an Algebraic Trapdoor.
Proceedings of the Algebraic Informatics - 6th International Conference, 2015

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

Some security bounds for the DGHV scheme.
IACR Cryptol. ePrint Arch., 2014

Two novel applications of bilinear groups to ABE encryption.
IACR Cryptol. ePrint Arch., 2014

Implementation and improvement of the Partial Sum Attack on 6-round AES.
IACR Cryptol. ePrint Arch., 2014

On the Hermitian curve and its intersections with some conics.
Finite Fields Their Appl., 2014

On the group generated by the round functions of translation based ciphers over arbitrary finite fields.
Finite Fields Their Appl., 2014

A weight-distribution bound for entropy extractors using linear binary codes.
CoRR, 2014

On some differential properties of Boolean functions.
CoRR, 2014

Some security bounds for the key sizes of DGHV scheme.
Appl. Algebra Eng. Commun. Comput., 2014

2013
On the evaluation of multivariate polynomials over finite fields.
J. Symb. Comput., 2013

A generalization of bounds for cyclic codes, including the HT and BS bounds.
CoRR, 2013

A New Bound for Cyclic Codes Beating the Roos Bound.
Proceedings of the Algebraic Informatics - 5th International Conference, 2013

Generalized AG Codes as Evaluation Codes.
Proceedings of the Algebraic Informatics - 5th International Conference, 2013

2012
On weakly APN functions and 4-bit S-Boxes.
Finite Fields Their Appl., 2012

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

2011
Complexity of multivariate polynomial evaluation
CoRR, 2011

On the provable security of BEAR and LION schemes.
Appl. Algebra Eng. Commun. Comput., 2011

2010
Do AES encryptions act randomly?
CoRR, 2010

A possible intrinsic weakness of AES and other cryptosystems
CoRR, 2010

2009
Error resilient data transport in sensor network applications: A generic perspective.
Int. J. Circuit Theory Appl., 2009

An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher.
Des. Codes Cryptogr., 2009

Computing the distance distribution of systematic non-linear codes
CoRR, 2009

Quasi-cyclic LDPC codes with high girth
CoRR, 2009

A bound on the size of linear codes
CoRR, 2009

On some block ciphers and imprimitive groups.
Appl. Algebra Eng. Commun. Comput., 2009

Gröbner Bases, Coding, and Cryptography: a Guide to the State-of-Art.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

2007
General Error Locator Polynomials for Binary Cyclic Codes With t<=2 and n<63.
IEEE Trans. Inf. Theory, 2007

Efficient construction and implementation of short LDPC codes for wireless sensor networks.
Proceedings of the 18th European Conference on Circuit Theory and Design, 2007

Low cost error recovery in Delay-Intolerant Wireless Sensor Networks.
Proceedings of the 18th European Conference on Circuit Theory and Design, 2007

2006
A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set.
IEEE Trans. Inf. Theory, 2006

Imprimitive permutations groups generated by the round functions of key-alternating block ciphers and truncated differential cryptanalysis
CoRR, 2006

Adaptive Array Processing for Time-Varying Interference Mitigation in IEEE 802.16 Systems.
Proceedings of the IEEE 17th International Symposium on Personal, 2006

2003
On the Gröbner bases of some symmetric systems and their application to coding theory.
J. Symb. Comput., 2003

Upper Bounds on the Dual Distance of <i>BCH</i>(255, <i>k</i>).
Des. Codes Cryptogr., 2003

2002
Groebner Bases and Distance of Cyclic Codes.
Appl. Algebra Eng. Commun. Comput., 2002

2000
A linear programming estimate of the weight distribution of BCH(255, k).
IEEE Trans. Inf. Theory, 2000


  Loading...