The structured generic-group model
From MaRDI portal
Cites work
- A cryptanalytic time-memory trade-off
- A general framework for subexponential discrete logarithm algorithms
- A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
- A new approach to generic lower bounds. Classical/quantum MDL, quantum factoring, and more
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- Accumulators in (and beyond) generic groups: non-trivial batch verification requires interaction
- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
- Advances in Cryptology - EUROCRYPT 2004
- An analysis of the algebraic group model
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Another look at generic groups
- Asymptotically Fast Factorization of Integers
- Breaking RSA Generically Is Equivalent to Factoring
- Breaking RSA Generically Is Equivalent to Factoring
- Complexity of a determinate algorithm for the discrete logarithm
- Cryptography and Coding
- Discrete logarithms in \(\mathrm{GF}(p)\)
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Elliptic Curve Cryptosystems
- Fast Computation of Discrete Logarithms in GF (q)
- Function field sieve method for discrete logarithms over finite fields
- Generic and algebraic computation models: when AGM proofs transfer to the GGM
- Generic groups, collision resistance, and ECDSA
- Generic Hardness of the Multiple Discrete Logarithm Problem
- Generic-group delay functions require hidden-order groups
- Generic-Group Identity-Based Encryption: A Tight Impossibility Result
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- scientific article; zbMATH DE number 1583771 (Why is no real title available?)
- scientific article; zbMATH DE number 1583798 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 3956969 (Why is no real title available?)
- scientific article; zbMATH DE number 4077312 (Why is no real title available?)
- scientific article; zbMATH DE number 2086711 (Why is no real title available?)
- scientific article; zbMATH DE number 799760 (Why is no real title available?)
- scientific article; zbMATH DE number 799769 (Why is no real title available?)
- scientific article; zbMATH DE number 3353398 (Why is no real title available?)
- Impossibility of order-revealing encryption in idealized models
- Index calculus attack for hyperelliptic curves of small genus
- Monte Carlo Methods for Index Computation (mod p)
- New directions in cryptography
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
- On asymptotic complexity of computing discrete logarithms over GF(p)
- On the analysis of cryptographic assumptions in the generic ring model
- Random Oracles and Auxiliary Input
- Random oracles and non-uniformity
- Reducing elliptic curve logarithms to logarithms in a finite field
- Smooth numbers: computational number theory and beyond
- The algebraic group model and its applications
- The discrete logarithm problem on elliptic curves of trace one
- The Discrete Logarithm problem with preprocessing
- The Exact Security of ECIES in the Generic Group Model
- The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
- The state of elliptic curve cryptography
- The Uber-Assumption Family
- To label, or not to label (in generic groups)
- Unifying presampling via concentration bounds
This page was built for publication: The structured generic-group model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7304136)