Practical Cryptography in High Dimensional Tori
From MaRDI portal
Recommendations
Cited in
(13)- Effective compression maps for torus-based cryptography
- Efficient multiplication in finite field extensions of degree 5
- Compression in Finite Fields and Torus-Based Cryptography
- Factor-4 and 6 compression of cyclotomic subgroups of \(\mathbb F^*_{2^{4m}}\) and \(\mathbb F^*_{3^{6m}}\)
- The Function Field Sieve in the Medium Prime Case
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms
- On Cryptographic Schemes Based on Discrete Logarithms and Factoring
- Faster individual discrete logarithms in finite fields of composite extension degree
- An optimal representation for the trace zero subgroup
- Advances in Cryptology – CRYPTO 2004
- Toward Acceleration of RSA Using 3D Graphics Hardware
- Algorithmic Number Theory
- Discretization error reduction for high precision torus fully homomorphic encryption
This page was built for publication: Practical Cryptography in High Dimensional Tori
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385732)