Exécution de notre outil de synthèse sur un nouvel article
Vérifiez l’article ci-dessous, puis lancez sa synthèse.
Replicability: Challenging the Myth of Randomness Patterns in Encrypted Traffic
Timofey Shpakov (ETH Zurich), Martin Burkhart, Laurent Vanbever (ETH Zurich)
ACM Internet Measurement Conference (IMC)
DOI: 10.1145/3777912.3839783 (Computer Science)
Licence : CC BY
Résumé : Several recent studies claim that encrypted network traffic exhibits statistically significant randomness deficiencies due to differences in cryptographic algorithms, implementations, and parameterization, and that such patterns can be exploited for application classification in TLS traffic. This interpretation has been adopted by measurement researchers, most prominently in the often-cited ET-BERT study.
Publié le 29 Sep. 2026