Breaking ‘128-bit Secure’ Supersingular Binary Curves
From MaRDI portal
Publication:2874534
DOI10.1007/978-3-662-44381-1_8zbMath1334.94080arXiv1402.3668OpenAlexW1518618574MaRDI QIDQ2874534
Jens Zumbrägel, Thorsten Kleinjung, Robert Granger
Publication date: 7 August 2014
Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.3668
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (25)
Smoothness test for polynomials defined over small characteristic finite fields ⋮ Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields ⋮ Classifying and generating exact coset representatives of \(\operatorname{PGL}_2(\mathbb{F}_q)\) in \(\operatorname{PGL}_2(\mathbb{F}_{q^2})\) ⋮ New discrete logarithm computation for the medium prime case using the function field sieve ⋮ Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression ⋮ Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability ⋮ A survey of elliptic curves for proof systems ⋮ Individual discrete logarithm with sublattice reduction ⋮ Roots of certain polynomials over finite fields ⋮ Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ On the discrete logarithm problem in finite fields of fixed characteristic ⋮ Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ ⋮ Computing discrete logarithms in \(\mathbb F_{p^6}\) ⋮ Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts ⋮ Updating key size estimations for pairings ⋮ Almost perfect nonlinear trinomials and hexanomials ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography ⋮ Computation of a 30750-bit binary field discrete logarithm ⋮ Faster initial splitting for small characteristic composite extension degree fields ⋮ Structure-preserving public-key encryption with leakage-resilient CCA security ⋮ Still wrong use of pairings in cryptography ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
This page was built for publication: Breaking ‘128-bit Secure’ Supersingular Binary Curves
