The following pages link to Massimiliano Sala (Q402559):
Displaying 50 items.
- On the Hermitian curve and its intersections with some conics (Q402560) (← links)
- On weakly APN functions and 4-bit S-boxes (Q413552) (← links)
- On the provable security of BEAR and LION schemes (Q429778) (← links)
- On the small-weight codewords of some Hermitian codes (Q491244) (← links)
- On weak differential uniformity of vectorial Boolean functions as a cryptographic criterion (Q503549) (← links)
- The group generated by the round functions of a GOST-like cipher (Q509556) (← links)
- Correcting errors and erasures via the syndrome variety (Q557068) (← links)
- Improved decoding of affine-variety codes (Q714109) (← links)
- An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher (Q735032) (← links)
- HELP: a sparse error locator polynomial for BCH codes (Q780362) (← links)
- (Q843944) (redirect page) (← links)
- On some block ciphers and imprimitive groups (Q843945) (← links)
- On the Gröbner basis of a family of quasi-cyclic LDPC codes (Q874805) (← links)
- A commutative algebra approach to linear codes (Q1024390) (← links)
- Upper bounds on the dual distance of BCH\((255, k)\) (Q1412246) (← links)
- On the Gröbner bases of some symmetric systems and their application to coding theory. (Q1426139) (← links)
- Gröbner bases and distance of cyclic codes (Q1606071) (← links)
- On hidden sums compatible with a given block cipher diffusion layer (Q1625795) (← links)
- Several proofs of security for a tokenization algorithm (Q1683979) (← links)
- Wave-shaped round functions and primitive groups (Q1726011) (← links)
- Differential attacks: using alternative operations (Q1727339) (← links)
- On the discrete logarithm problem for prime-field elliptic curves (Q1747918) (← links)
- Hilbert quasi-polynomial for order domains and application to coding theory (Q1783726) (← links)
- On the evaluation of multivariate polynomials over finite fields (Q1930170) (← links)
- Postulation of general quintuple fat point schemes in \(\mathbb P^3\) (Q1938533) (← links)
- A deterministic algorithm for the distance and weight distribution of binary nonlinear codes (Q1993387) (← links)
- Intersections between the norm-trace curve and some low degree curves (Q1994932) (← links)
- Weight distribution of Hermitian codes and matrices rank (Q2007709) (← links)
- On the linear structures of balanced functions and quadratic APN functions (Q2040300) (← links)
- Threshold ECDSA with an offline recovery party (Q2053769) (← links)
- On properties of translation groups in the affine general linear group with applications to cryptography (Q2216563) (← links)
- Some security bounds for the key sizes of DGHV scheme (Q2254535) (← links)
- A note on APN permutations in even dimension (Q2363313) (← links)
- On the group generated by the round functions of translation based ciphers over arbitrary finite fields (Q2434409) (← links)
- A discrete logarithm-based approach to compute low-weight multiples of binary polynomials (Q2634391) (← links)
- A formula on the weight distribution of linear codes with applications to AMDS codes (Q2667076) (← links)
- Rational points on cubic surfaces and AG codes from the norm-trace curve (Q2678902) (← links)
- On the equivalence of two post-quantum cryptographic families (Q2687966) (← links)
- A linear programming estimate of the weight distribution of BCH\((255,k)\) (Q2705951) (← links)
- Generalized AG Codes as Evaluation Codes (Q2850004) (← links)
- A New Bound for Cyclic Codes Beating the Roos Bound (Q2850007) (← links)
- On Differential Uniformity of Maps that May Hide an Algebraic Trapdoor (Q2947148) (← links)
- Key-Policy Multi-authority Attribute-Based Encryption (Q2947155) (← links)
- Attacking BEAR and LION Schemes in a Realistic Scenario (Q2947159) (← links)
- On Optimal Nonlinear Systematic Codes (Q2976759) (← links)
- Some Bounds on the Size of Codes (Q2986470) (← links)
- (Q3436063) (← links)
- A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set (Q3547985) (← links)
- General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n &lt; 63$</tex></formula> (Q3548088) (← links)
- COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES (Q3562516) (← links)
