Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
From MaRDI portal
Publication:4911577
Recommendations
- Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing
- Cryptanalysis of pairing-based cryptosystems over small characteristic fields
- On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem
- Selected Areas in Cryptography
- Side channel attacks against pairing over theta functions
- Breaking a class of public-key cryptosystems with Euclid's algorithm
- On finite fields for pairing based cryptography
- Cryptanalysis of the \(MST_{3}\) public key cryptosystem
- Séta: Supersingular Encryption from Torsion Attacks
Cited in
(12)- Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs
- Effective compression maps for torus-based cryptography
- An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^n)\)
- Updating key size estimations for pairings
- On constructing parameterized families of pairing-friendly elliptic curves with \(\rho =1\)
- Solving a 676-bit discrete logarithm problem in \(\text{GF}(3^{6n})\)
- Heuristics of the Cocks-Pinch method
- Selecting polynomials for the function field sieve
- Cryptanalysis of pairing-based cryptosystems over small characteristic fields
- Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- Indiscreet logarithms in finite fields of small characteristic
This page was built for publication: Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911577)
