Antonio J. Di Scala
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Antonio J. Di Scala has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
- Gabriel Ruiz-Hernández
Instituto de Matemáticas, Universidad Nacional Autónoma de México, Quéretaro, Mexico
9 shared publications - Andrea Loi
Dipartimento di Matematica, Universitá di Cagliari, Italy
8 shared publications - Carlo Sanna
Department of Mathematical Sciences, Polytechnic of Turin, Turin, Italy
7 shared publications - Francisco Vittone
Universidad Nacional de Rosario-CONICET, Rosario, Argentina
7 shared publications - Carlos Olmos
Universidad Nacional de Córdoba, Argentina
5 shared publications - Carlos Olmos
FaMAF, Universidad Nacional de Córdoba, Ciudad Universitaria, 5000 Córdoba, Argentina
3 shared publications
Latest Publications
- Open Access
- 30 October 2026
- Published by Springer Nature in The Journal of Geometric Analysis
- Vol. 36 (12) , 405
Kähler–Einstein Toric Submanifolds of the Projective Space
We show that the Kähler–Einstein metrics on the four families of symmetric toric Fano manifolds due to Batyrev and Selivanova cannot be induced by immersions into projective spaces equipped with the Fubini–Study metric. We also show a similar conclusion for the non-symmetric examples discovered by Nill and Paffenholz. As an application we obtain that a centrally symmetric toric Fano manifold admits a Kähler–Einstein metric induced by a projective immersion if and only if it is a product of projective lines. These results confirm for each of these examples a broader conjecture characterizing the Kähler–Einstein metrics that can be induced by projective immersions.
- 30 October 2026
- Published by Springer Nature in The Journal of Geometric Analysis
- Vol. 36 (12) , 405
Open AccessKähler–Einstein Toric Submanifolds of the Projective Space
We show that the Kähler–Einstein metrics on the four families of symmetric toric Fano manifolds due to Batyrev and Selivanova cannot be induced by immersions into projective spaces equipped with the Fubini–Study metric. We also show a similar conclusion for the non-symmetric examples discovered by Nill and Paffenholz. As an application we obtain that a centrally symmetric toric Fano manifold admits a Kähler–Einstein metric induced by a projective immersion if and only if it is a product of projective lines. These results confirm for each of these examples a broader conjecture characterizing the Kähler–Einstein metrics that can be induced by projective immersions.
- Open Access
Kähler-Einstein toric submanifolds of the projective space
We show that the Kähler-Einstein metrics on the four families of examples of symmetric toric Fano manifolds presented by Batyrev and Selivanova cannot be realized as metrics induced by immersions into projective spaces equipped with Fubini-Study metrics. We obtain a similar conclusion for the non-symmetric examples discovered by Nill and Paffenholz. A consequence is that a centrally symmetric toric Fano manifold admits a Kähler-Einstein metric induced by a projective immersion if and only if it is a product of projective lines. These results provide evidence for a broader conjecture characterizing which Kähler-Einstein metrics can be induced by projective immersions.
Open AccessKähler-Einstein toric submanifolds of the projective space
We show that the Kähler-Einstein metrics on the four families of examples of symmetric toric Fano manifolds presented by Batyrev and Selivanova cannot be realized as metrics induced by immersions into projective spaces equipped with Fubini-Study metrics. We obtain a similar conclusion for the non-symmetric examples discovered by Nill and Paffenholz. A consequence is that a centrally symmetric toric Fano manifold admits a Kähler-Einstein metric induced by a projective immersion if and only if it is a product of projective lines. These results provide evidence for a broader conjecture characterizing which Kähler-Einstein metrics can be induced by projective immersions.
- Open Access
- 1 January 2025
- Published by Walter de Gruyter GmbH in Journal of Mathematical Cryptology
- Vol. 19 (1)
Smaller public keys for MinRank-based schemes
MinRank is an NP-complete problem in linear algebra whose characteristics make it attractive to build post-quantum cryptographic primitives. Several MinRank-based digital signature schemes have been proposed. In particular, two of them, MIRA and MiRitH, have been submitted to the NIST post-quantum cryptography standardization process. In this article, we propose a key-generation algorithm for MinRank-based schemes that reduces the size of the public key to about 50% of the size of the public key generated by the previous best (in terms of public-key size) algorithm. Precisely, the size of the public key generated by our algorithm sits in the range of 328–676 bits for security levels of 128–256 bits. We also prove that our algorithm is as secure as the previous ones.
- 1 January 2025
- Published by Walter de Gruyter GmbH in Journal of Mathematical Cryptology
- Vol. 19 (1)
Open AccessSmaller public keys for MinRank-based schemes
MinRank is an NP-complete problem in linear algebra whose characteristics make it attractive to build post-quantum cryptographic primitives. Several MinRank-based digital signature schemes have been proposed. In particular, two of them, MIRA and MiRitH, have been submitted to the NIST post-quantum cryptography standardization process. In this article, we propose a key-generation algorithm for MinRank-based schemes that reduces the size of the public key to about 50% of the size of the public key generated by the previous best (in terms of public-key size) algorithm. Precisely, the size of the public key generated by our algorithm sits in the range of 328–676 bits for security levels of 128–256 bits. We also prove that our algorithm is as secure as the previous ones.
- 12 December 2024
- Published by Springer Nature
- p. 35-65
Don’t Use it Twice! Solving Relaxed Linear Equivalence Problems
- 12 December 2024
- Published by Springer Nature
- p. 35-65
Don’t Use it Twice! Solving Relaxed Linear Equivalence Problems
- Open Access
Smaller public keys for MinRank-based schemes
MinRank is an NP-complete problem in linear algebra whose characteristics make it attractive to build post-quantum cryptographic primitives. Several MinRank-based digital signature schemes have been proposed. In particular, two of them, MIRA and MiRitH, have been submitted to the NIST Post-Quantum Cryptography Standardization Process. In this paper, we propose a key-generation algorithm for MinRank-based schemes that reduces the size of the public key to about 50% of the size of the public key generated by the previous best (in terms of public-key size) algorithm. Precisely, the size of the public key generated by our algorithm sits in the range of 328-676 bits for security levels of 128-256 bits. We also prove that our algorithm is as secure as the previous ones.
Open AccessSmaller public keys for MinRank-based schemes
MinRank is an NP-complete problem in linear algebra whose characteristics make it attractive to build post-quantum cryptographic primitives. Several MinRank-based digital signature schemes have been proposed. In particular, two of them, MIRA and MiRitH, have been submitted to the NIST Post-Quantum Cryptography Standardization Process. In this paper, we propose a key-generation algorithm for MinRank-based schemes that reduces the size of the public key to about 50% of the size of the public key generated by the previous best (in terms of public-key size) algorithm. Precisely, the size of the public key generated by our algorithm sits in the range of 328-676 bits for security levels of 128-256 bits. We also prove that our algorithm is as secure as the previous ones.
- Open Access
- 3 August 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (15) , 2746
Special Subsets of Addresses for Blockchains Using the secp256k1 Curve
In 2020, Sala, Sogiorno and Taufer were able to find the private keys of some Bitcoin addresses, thus being able to spend the cryptocurrency linked to them. This was unexpected since the recovery of non-trivial private keys for blockchain addresses is deemed to be an infeasible problem. In this paper, we widen this analysis by mounting a similar attack on other small subsets of the set of private keys. We then apply it to other blockchains as well, examining Ethereum, Dogecoin, Litecoin, Dash, Zcash and Bitcoin Cash. In addition to the results, we also explain the techniques we have used to perform this exhaustive search for all the addresses that have ever appeared in these blockchains, and we give an estimate of the time needed to perform all the computations. Finally, we also examine the possibility of mounting a similar attack on other elliptic curves used in blockchains, i.e., Curve25519 and NIST P-256.
- 3 August 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (15) , 2746
Open AccessSpecial Subsets of Addresses for Blockchains Using the secp256k1 Curve
In 2020, Sala, Sogiorno and Taufer were able to find the private keys of some Bitcoin addresses, thus being able to spend the cryptocurrency linked to them. This was unexpected since the recovery of non-trivial private keys for blockchain addresses is deemed to be an infeasible problem. In this paper, we widen this analysis by mounting a similar attack on other small subsets of the set of private keys. We then apply it to other blockchains as well, examining Ethereum, Dogecoin, Litecoin, Dash, Zcash and Bitcoin Cash. In addition to the results, we also explain the techniques we have used to perform this exhaustive search for all the addresses that have ever appeared in these blockchains, and we give an estimate of the time needed to perform all the computations. Finally, we also examine the possibility of mounting a similar attack on other elliptic curves used in blockchains, i.e., Curve25519 and NIST P-256.
- Open Access
Special subsets of addresses for blockchains using the secp256k1 curve
In 2020 Sala, Sogiorno and Taufer have been able to find the private keys of some Bitcoin addresses, thus being able to spend the cryptocurrency linked to them. This result was unexpected, since the recovery of non-trivial private keys for blockchain addresses is deemed to be an infeasible problem. In this paper we widen this analysis by mounting a similar attack to other small subsets of the set of private keys. We then apply it to other blockchains as well, examining Ethereum, Dogecoin, Litecoin, Dash, Zcash and Bitcoin Cash. In addition to the results, we also explain the techniques we have used to perform this exhaustive search for all the addresses that have ever appeared in these blockchains.
Open AccessSpecial subsets of addresses for blockchains using the secp256k1 curve
In 2020 Sala, Sogiorno and Taufer have been able to find the private keys of some Bitcoin addresses, thus being able to spend the cryptocurrency linked to them. This result was unexpected, since the recovery of non-trivial private keys for blockchain addresses is deemed to be an infeasible problem. In this paper we widen this analysis by mounting a similar attack to other small subsets of the set of private keys. We then apply it to other blockchains as well, examining Ethereum, Dogecoin, Litecoin, Dash, Zcash and Bitcoin Cash. In addition to the results, we also explain the techniques we have used to perform this exhaustive search for all the addresses that have ever appeared in these blockchains.
- Open Access
- 30 April 2022
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 35 (3) , 351-358
RLWE and PLWE over cyclotomic fields are not equivalent
We prove that the Ring Learning With Errors (RLWE) and the Polynomial Learning With Errors (PLWE) problems over the cyclotomic field $${\mathbb {Q}}(\zeta _n)$$ are not equivalent. Precisely, we show that reducing one problem to the other increases the noise by a factor that is more than polynomial in n. We do so by providing a lower bound, holding for infinitely many positive integers n, for the condition number of the Vandermonde matrix of the nth cyclotomic polynomial.- 30 April 2022
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 35 (3) , 351-358
Open AccessRLWE and PLWE over cyclotomic fields are not equivalent
We prove that the Ring Learning With Errors (RLWE) and the Polynomial Learning With Errors (PLWE) problems over the cyclotomic field $${\mathbb {Q}}(\zeta _n)$$ are not equivalent. Precisely, we show that reducing one problem to the other increases the noise by a factor that is more than polynomial in n. We do so by providing a lower bound, holding for infinitely many positive integers n, for the condition number of the Vandermonde matrix of the nth cyclotomic polynomial. - Open Access
A note on the determinant 308 in Proskuryakov's linear algebra book
We put in evidence and correct a mistake in the formula for the determinant 308 in Proskuryakov's linear algebra book. We apply this formula to reprove the well-known fact that the Fubini-Study metric on the complex projective space is Einstein.
Open AccessA note on the determinant 308 in Proskuryakov's linear algebra book
We put in evidence and correct a mistake in the formula for the determinant 308 in Proskuryakov's linear algebra book. We apply this formula to reprove the well-known fact that the Fubini-Study metric on the complex projective space is Einstein.
- Open Access
RLWE and PLWE over cyclotomic fields are not equivalent
We prove that the Ring Learning With Errors (RLWE) and the Polynomial Learning With Errors (PLWE) problems over the cyclotomic field $\mathbb{Q}(\zeta_n)$ are not equivalent. Precisely, we show that reducing one problem to the other increases the noise by a factor that is more than polynomial in $n$. We do so by providing a lower bound, holding for infinitely many positive integers $n$, for the condition number of the Vandermonde matrix of the $n$th cyclotomic polynomial.Open AccessRLWE and PLWE over cyclotomic fields are not equivalent
We prove that the Ring Learning With Errors (RLWE) and the Polynomial Learning With Errors (PLWE) problems over the cyclotomic field $\mathbb{Q}(\zeta_n)$ are not equivalent. Precisely, we show that reducing one problem to the other increases the noise by a factor that is more than polynomial in $n$. We do so by providing a lower bound, holding for infinitely many positive integers $n$, for the condition number of the Vandermonde matrix of the $n$th cyclotomic polynomial.