Complexity of a determinate algorithm for the discrete logarithm
From MaRDI portal
Publication:1898267
DOI10.1007/BF02113297zbMath0831.11065MaRDI QIDQ1898267
Publication date: 24 September 1995
Published in: Mathematical Notes (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)
Related Items (50)
Does Fiat-Shamir require a cryptographic hash function? ⋮ Algorithms for Black-Box Fields and their Application to Cryptography ⋮ On the analysis of cryptographic assumptions in the generic ring model ⋮ Predicate encryption supporting disjunctions, polynomial equations, and inner products ⋮ A Leakage Resilient MAC ⋮ Bootstrapping for approximate homomorphic encryption ⋮ On improvements of ther-adding walk in a finite field of characteristic 2 ⋮ On the security of ECDSA with additive key derivation and presignatures ⋮ On the multi-user security of short Schnorr signatures with preprocessing ⋮ On the (In)security of Kilian-based SNARGs ⋮ Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm ⋮ Baby-step giant-step algorithms for the symmetric group ⋮ The One-More Discrete Logarithm Assumption in the Generic Group Model ⋮ On the security of functional encryption in the generic group model ⋮ Automated analysis of cryptographic assumptions in generic group models ⋮ Attribute-Based Broadcast Encryption Scheme Made Efficient ⋮ On time-lock cryptographic assumptions in abelian hidden-order groups ⋮ Algebraic adversaries in the universal composability framework ⋮ To label, or not to label (in generic groups) ⋮ Parallel repetition of computationally sound protocols revisited ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ An analysis of the algebraic group model ⋮ The hunting of the SNARK ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ On the Classification of Knowledge-of-exponent Assumptions in Cyclic Groups ⋮ Generic hardness of inversion on ring and its relation to self-bilinear map ⋮ Algebraic curves and cryptography ⋮ Enhancing the security of perfect blind DL-signatures ⋮ Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Discrete logarithm problems with auxiliary inputs ⋮ On subversion-resistant SNARKs ⋮ On the security properties of Russian standardized elliptic curves ⋮ Generic-group delay functions require hidden-order groups ⋮ Breaking RSA Generically Is Equivalent to Factoring ⋮ Towards a security model for computational puzzle schemes ⋮ Efficient fully structure-preserving signatures and shrinking commitments ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ Cryptosystems based on semi-distributive algebras ⋮ On the Equivalence of Generic Group Models ⋮ Generic groups, collision resistance, and ECDSA ⋮ On succinct arguments and witness encryption from groups ⋮ A classification of computational assumptions in the algebraic group model ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions ⋮ Machine-Checked Security Proofs of Cryptographic Signature Schemes ⋮ Small generic hardcore subsets for the discrete logarithm: short secret DL-keys. ⋮ Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model ⋮ On instantiating the algebraic group model from falsifiable assumptions
Cites Work
This page was built for publication: Complexity of a determinate algorithm for the discrete logarithm
