ON BOUNDS FOR BALANCED EMBEDDING DEGREE
From MaRDI portal
Publication:5150737
DOI10.17223/20710410/32/5zbMATH Open1490.14045OpenAlexW2461549630MaRDI QIDQ5150737FDOQ5150737
Authors: S. A. Novoselov 
Publication date: 15 February 2021
Published in: Prikladnaya diskretnaya matematika (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/pdm546
Recommendations
- Tight bounds for embedding bounded degree trees
- Approximation and inaproximability results on balanced connected partitions of graphs
- On embedding graphs with bounded sum of size and maximum degree
- Embeddings of graphs of fixed treewidth and bounded degree
- Bounded Embeddings of Graphs in the Plane
- Balanced embedding of degenerating abelian varieties
- scientific article; zbMATH DE number 5938882
- Bounds for judicious balanced bipartitions of graphs
- A generalized lower bound theorem for balanced manifolds
- Lower bound theorems and a generalized lower bound conjecture for balanced simplicial complexes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- On the Lambert \(w\) function
- A taxonomy of pairing-friendly elliptic curves
- A new index calculus algorithm with complexity \(L(1/4+o(1))\) in small characteristic
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Monte Carlo Methods for Index Computation (mod p)
- Title not available (Why is that?)
- A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
- Computing in the Jacobian of a Hyperelliptic Curve
- The Weil pairing, and its efficient calculation
- Improved agreeing-gluing algorithm
- Title not available (Why is that?)
- Advances in Elliptic Curve Cryptography
- Reducing elliptic curve logarithms to logarithms in a finite field
- Computing discrete logarithms in \(\mathbb F_{3^{6 \cdot 137}}\) and \(\mathbb F_{3^{6 \cdot 163}}\) using Magma
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- Title not available (Why is that?)
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Constructive and destructive facets of Weil descent on elliptic curves
- A double large prime variation for small genus hyperelliptic index calculus
- A general framework for subexponential discrete logarithm algorithms
- Aspects of Pairing Inversion
- Selecting cryptographic key sizes
- An \(L(1/3)\) discrete logarithm algorithm for low degree curves
- Title not available (Why is that?)
- The past, evolving present, and future of the discrete logarithm
- Hyperelliptic Pairings
- Extended tower number field sieve: a new complexity for the medium prime case
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
- Pairings on hyperelliptic curves
- On the Minimal Embedding Field
- Abelian Varieties with Prescribed Embedding Degree
- Constructing pairing-friendly hyperelliptic curves using Weil restriction
- The multiple number field sieve for medium- and high-characteristic finite fields
- The multiple number field sieve with conjugation and generalized Joux-Lercier methods
- A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax
- Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
- On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields
- Constructing pairing-friendly genus 2 curves with split Jacobian
- Generating more Kawazoe-Takahashi genus 2 pairing-friendly hyperelliptic curves
This page was built for publication: ON BOUNDS FOR BALANCED EMBEDDING DEGREE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5150737)
