Discrete logarithms for finite groups
| العنوان: | Discrete logarithms for finite groups |
|---|---|
| المؤلفون: | Michal Sramka, Fred Richman, Lee Klingler, Spyros S. Magliveras |
| المصدر: | Computing. 85:3-19 |
| بيانات النشر: | Springer Science and Business Media LLC, 2009. |
| سنة النشر: | 2009 |
| مصطلحات موضوعية: | Discrete mathematics, Numerical Analysis, Finite group, Multiset, Cryptographic primitive, Logarithm, Prime (order theory), Computer Science Applications, Theoretical Computer Science, Non-abelian group, Algebra, Computational Mathematics, Computational Theory and Mathematics, Discrete logarithm, Security of cryptographic hash functions, Software, Computer Science::Cryptography and Security, Mathematics |
| الوصف: | We present group-theoretic and cryptographic properties of a generalization of the traditional discrete logarithm problem from cyclic to arbitrary finite groups. Questions related to properties which contribute to cryptographic security are investigated, such as distributional, coverage and complexity properties. We show that the distribution of elements in a certain multiset tends to uniform. In particular we consider the family of finite non-abelian groups , p a prime, as possible candidates in the design of new cryptographic primitives, based on our new discrete logarithm. |
| تدمد: | 1436-5057 0010-485X |
| DOI: | 10.1007/s00607-009-0032-0 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::38a887f7c1916ff96da29623a7a0acd0 https://doi.org/10.1007/s00607-009-0032-0 |
| Rights: | CLOSED |
| رقم الانضمام: | edsair.doi...........38a887f7c1916ff96da29623a7a0acd0 |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 14365057 0010485X |
|---|---|
| DOI: | 10.1007/s00607-009-0032-0 |