Advances in Cryptology – EUROCRYPT 2014

@inproceedings{Nguyen2014AdvancesIC,
  title={Advances in Cryptology – EUROCRYPT 2014},
  author={Phong Q. Nguyen and Elisabeth Oswald},
  booktitle={Lecture Notes in Computer Science},
  year={2014}
}
The difficulty of computing discrete logarithms in fields Fqk depends on the relative sizes of k and q. Until recently all the cases had a sub-exponential complexity of type L(1/3), similar to the factorization problem. In 2013, Joux designed a new algorithm with a complexity of L(1/4 + ) in small characteristic. In the same spirit, we propose in this article another heuristic algorithm that provides a quasi-polynomial complexity when q is of size at most comparable with k. By quasi-polynomial… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 56 REFERENCES

Rényi Divergence and Kullback-Leibler Divergence

  • IEEE Transactions on Information Theory
  • 2014
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Circular and KDM Security for Identity-Based Encryption

  • Public Key Cryptography
  • 2012
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

On the Circular Security of Bit-Encryption

  • IACR Cryptology ePrint Archive
  • 2012
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Pseudorandom Functions and Lattices

  • IACR Cryptology ePrint Archive
  • 2011
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL