Updating key size estimations for pairings
R Barbulescu, S Duquesne - Journal of cryptology, 2019 - Springer
Recent progress on NFS imposed a new estimation of the security of pairings. In this work
we study the best attacks against some of the most popular pairings and propose new key …
we study the best attacks against some of the most popular pairings and propose new key …
The specifics of the Galois field GF(257) and its use for digital signal processing
A Bakirov, D Matrassulova, Y Vitulyova… - Scientific Reports, 2024 - nature.com
An algorithm of digital logarithm calculation for the Galois field GF (257) is proposed. It is
shown that this field is coupled with one of the most important existing standards that uses a …
shown that this field is coupled with one of the most important existing standards that uses a …
Group-based secure computation: optimizing rounds, communication, and computation
A recent work of Boyle et al.(Crypto 2016) suggests that “group-based” cryptographic
protocols, namely ones that only rely on a cryptographically hard (Abelian) group, can be …
protocols, namely ones that only rely on a cryptographically hard (Abelian) group, can be …
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
We report on two new records: the factorization of RSA-240, a 795-bit number, and a
discrete logarithm computation over a 795-bit prime field. Previous records were the …
discrete logarithm computation over a 795-bit prime field. Previous records were the …
Cocks–Pinch curves of embedding degrees five to eight and optimal ate pairing computation
A Guillevic, S Masson, E Thomé - Designs, Codes and Cryptography, 2020 - Springer
Recent algorithmic improvements of discrete logarithm computation in special extension
fields threaten the security of pairing-friendly curves used in practice. A possible answer to …
fields threaten the security of pairing-friendly curves used in practice. A possible answer to …
On the alpha value of polynomials in the tower number field sieve algorithm
A Guillevic, S Singh - Mathematical Cryptology, 2021 - journals.flvc.org
In this paper, we provide a notable step towards filling the gap between theory (estimates of
running-time) and practice (a discrete logarithm record computation) for the Tower Number …
running-time) and practice (a discrete logarithm record computation) for the Tower Number …
Breaking the encryption scheme of the Moscow internet voting system
P Gaudry, A Golovnev - Financial Cryptography and Data Security: 24th …, 2020 - Springer
In September 2019, voters for the election at the Parliament of the city of Moscow were
allowed to use an Internet voting system. The source code of it had been made available for …
allowed to use an Internet voting system. The source code of it had been made available for …
[PDF][PDF] CHVote System Specification.
R Haenni, RE Koenig, P Locher… - IACR Cryptol. ePrint …, 2017 - researchgate.net
Over many years, the State of Geneva has been one of the worldwide pioneers in offering
Internet elections to their citizens. The project, which was initiated in 2001, was one of first …
Internet elections to their citizens. The project, which was initiated in 2001, was one of first …
Prime and prejudice: primality testing under adversarial conditions
This work provides a systematic analysis of primality testing under adversarial conditions,
where the numbers being tested for primality are not generated randomly, but instead …
where the numbers being tested for primality are not generated randomly, but instead …
Crypto crumple zones: Enabling limited access without mass surveillance
Governments around the world are demanding more access to encrypted data, but it has
been difficult to build a system that allows the authorities some access without providing …
been difficult to build a system that allows the authorities some access without providing …