# Discrete logarithm and Diffie-Hellman problems in identity black-box groups

@article{Ivanyos2019DiscreteLA, title={Discrete logarithm and Diffie-Hellman problems in identity black-box groups}, author={G'abor Ivanyos and Antoine Joux and Miklos Santha}, journal={ArXiv}, year={2019}, volume={abs/1911.01662} }

We investigate the computational complexity of the discrete logarithm, the computational Diffie-Hellman and the decisional Diffie-Hellman problems in some identity black-box groups G_{p,t}, where p is a prime number and t is a positive integer. These are defined as quotient groups of vector space Z_p^{t+1} by a hyperplane H given through an identity oracle. While in general black-box groups with unique encoding these computational problems are classically all hard and quantumly all easy, we… CONTINUE READING

#### Topics from this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 26 REFERENCES

## Negative weights make adversaries stronger

VIEW 1 EXCERPT

## Quantum Query Complexity of State Conversion

VIEW 1 EXCERPT

## Las Vegas algorithms for matrix groups

VIEW 1 EXCERPT

## Quantum algorithms for solvable groups

VIEW 1 EXCERPT