Public-key cryptosystem design based on factoring and discrete logarithms

@inproceedings{L2009PublickeyCD,
  title={Public-key cryptosystem design based on factoring and discrete logarithms},
  author={L..},
  year={2009}
}
  • L..
  • Published 2009
Most existing cryptosystem designs incorporate just one cryptographic assumption, such as factoring or discrete logarithms. These assumptions appear secure today; but, it is possible that efficient algorithms will be developed in the future lo break one or more of these assumptions. It is very unlikely that multiple cryptographic assumptions would simultaneously become easy to solve. Enhancing security is the major objective for cryptosystems based on multiple assumptions. K.S. McCurley… CONTINUE READING
Highly Cited
This paper has 41 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 29 extracted citations

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Elementary number theory and its applications’ (Addison-Wesley, 1992,3rd edn) 17 DENNING, D.E.R.: ’Cryptography and data security

  • K. H. ROSEN
  • (AddisonWesley,
  • 1982

Digitalized signatures and public key functions as intractable as factorization

  • M. O. RABIN
  • MIT/LCS/TR-212, January,
  • 1979

Similar Papers

Loading similar papers…