I Want to Ride My BICYCL : BICYCL Implements CryptographY in CLass Groups

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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of cryptology Ročník 36; číslo 3; s. 17
Hlavní autori: Bouvier, Cyril, Castagnos, Guilhem, Imbert, Laurent, Laguillaumie, Fabien
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.07.2023
Springer Nature B.V
Springer Verlag
Predmet:
Algorithms
Arithmetic
Coding and Information Theory
Combinatorics
Communications Engineering
Computational Mathematics and Numerical Analysis
Computer Science
Computing on Encrypted Data
Cryptography
Cryptography and Security
Encryption
Fields (mathematics)
Libraries
Networks
Number theory
Probability Theory and Stochastic Processes
Research Article
Multi-party computation
Implementation library
Class group cryptography
Quadratic form arithmetic
Linearly homomorphic encryption
implementation library
linearly homomorphic encryption
class group cryptography
quadratic form arithmetic
multi-party computation
ISSN:0933-2790, 1432-1378
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 group-based protocols become the best solution in terms of bandwidth and computational efficiency to rely upon.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0933-2790
1432-1378
DOI:10.1007/s00145-023-09459-1