Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method
From MaRDI portal
(Redirected from Publication:6663524)
Recommendations
Cites work
- A cryptanalytic time-memory trade-off
- Bounds in various generalized settings of the discrete logarithm problem
- Everybody's a target: scalability in public-key encryption
- Fixing cracks in the concrete: random oracles with auxiliary input, revisited
- Generic Hardness of the Multiple Discrete Logarithm Problem
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing
- scientific article; zbMATH DE number 2085207 (Why is no real title available?)
- Modern computer algebra
- Monte Carlo Methods for Index Computation (mod p)
- Multi-instance secure public-key encryption
- Multi-instance security and its application to password-based cryptography
- Public Key Cryptography - PKC 2006
- Time space tradeoffs for attacks against one-way functions and PRGs
This page was built for publication: Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663524)