I want to ride my BICYCL: BICYCL Implements CryptographY in CLass groups
BOUVIER, Cyril
Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier [LIRMM]
Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier [LIRMM]
CASTAGNOS, Guilhem
Lithe and fast algorithmic number theory [LFANT]
Analyse cryptographique et arithmétique [CANARI]
Leer más >
Lithe and fast algorithmic number theory [LFANT]
Analyse cryptographique et arithmétique [CANARI]
BOUVIER, Cyril
Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier [LIRMM]
Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier [LIRMM]
CASTAGNOS, Guilhem
Lithe and fast algorithmic number theory [LFANT]
Analyse cryptographique et arithmétique [CANARI]
< Leer menos
Lithe and fast algorithmic number theory [LFANT]
Analyse cryptographique et arithmétique [CANARI]
Idioma
en
Article de revue
Este ítem está publicado en
Journal of Cryptology. 2023-07, vol. 36, n° 3, p. 17
Springer Verlag
Resumen en inglés
We introduce BICYCL an Open Source C++ library that implements arithmetic in the ideal class groups of imaginary quadratic fields, together with a set of cryptographic primitives based on class groups. It is available at ...Leer más >
We introduce BICYCL an Open Source C++ library that implements arithmetic in the ideal class groups of imaginary quadratic fields, together with a set of cryptographic primitives based on class groups. It is available at https://gite.lirmm.fr/crypto/bicycl under GNU General Public License version 3 or any later version. BICYCL provides significant speed-ups on the implementation of the arithmetic of class groups. Concerning cryptographic applications, BICYCL is orders of magnitude faster than any previous pilot implementation of the CL linearly encryption scheme, making it faster than Paillier's encryption scheme at any security level. Linearly homomorphic encryption is the core of many multi-party computation protocols, sometimes involving a huge number of encryptions and homomorphic evaluations: class groupbased protocols become the best solution in terms of bandwidth and computational efficiency to rely upon.< Leer menos
Palabras clave en inglés
class group cryptography
quadratic form arithmetic
implementation library
linearly homomorphic encryption
multi-party computation
Proyecto ANR
Calcul réparti sécurisé : Cryptographie, Combinatoire, Calcul Formel - ANR-21-CE39-0006
Secure computations - ANR-22-PECY-0003
Secure computations - ANR-22-PECY-0003
Orígen
Importado de HalCentros de investigación