Abstract
In this paper we raise and discuss a problem from the analysis done in Moen et al. (ACM SIGMOBILE Comput Commun Rev 8(2):76–83, 2004) about some weaknesses in the key scheduling in Wi-Fi protected access (WPA).
References
Borisov, N., Goldberg, I., & Wagner, D. (2001). Intercepting mobile communications: The insecurity of 802.11. In MOBICOM 2001, Rome, Italy, July 2001.
Edney J., Arbaugh W. A. (2005) Real 802.11 security: Wi-Fi protected access and 802.11i. Addison-Wesley, Boston
Fluhrer, S. R., Mantin, I., & Shamir, A. (2001). Weaknesses in the key scheduling algorithm of RC4. In SAC: Annual International Workshop on Selected Areas in Cryptography, LNCS.
Moen V., Raddum H., Hole K. J. (2004) Weaknesses in the temporal key Hash of WPA. ACM SIGMOBILE Computing and Communications Review 8(2): 76–83
Morgadoz A., Carvalho J., Carvalho P., Fernandez P. (1991) Análise combinatória e probabilidade. Gráfica Wagner Ltda, Rio de Janeiro
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ferreira, R.A.C. A Probability Problem Arising from the Security of the Temporal Key Hash of WPA. Wireless Pers Commun 70, 1235–1241 (2013). https://doi.org/10.1007/s11277-012-0744-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-012-0744-x