# handshake

Published articles for handshake.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Pwning WPA/WPA2 Networks With Bettercap and the PMKID Client-Less Attack

DevFeed: [Pwning WPA/WPA2 Networks With Bettercap and the PMKID Client-Less Attack](<https://devfeed.tech/articles/pwning-wpa-wpa2-networks-with-bettercap-and-the-pmkid-client-less-attack-41261.md>)

Original publisher: [Read original article](<https://www.evilsocket.net/2019/02/13/Pwning-WiFi-networks-with-bettercap-and-the-PMKID-client-less-attack/>)

Author: Simone Margaritelli

Published: 2019-02-13T15:53:31Z

Content type: tutorial

Language: en

Sources: [evilsocket](<https://devfeed.tech/sources/evilsocket.md>)

Topics: [Networks](<https://devfeed.tech/topics/networks.md>), [passwords](<https://devfeed.tech/topics/passwords.md>), [client](<https://devfeed.tech/topics/client.md>), [GPU](<https://devfeed.tech/topics/gpu.md>)

Tags: [attacks](<https://devfeed.tech/tags/attacks.md>), [bettercap](<https://devfeed.tech/tags/bettercap.md>), [cybersecurity](<https://devfeed.tech/tags/cybersecurity.md>), [deauth](<https://devfeed.tech/tags/deauth.md>), [handshake](<https://devfeed.tech/tags/handshake.md>), [hashcat](<https://devfeed.tech/tags/hashcat.md>), [how-to](<https://devfeed.tech/tags/how-to.md>), [monitor-mode](<https://devfeed.tech/tags/monitor-mode.md>), [networks](<https://devfeed.tech/tags/networks.md>), [packet-injection](<https://devfeed.tech/tags/packet-injection.md>), [password-cracking](<https://devfeed.tech/tags/password-cracking.md>), [passwords](<https://devfeed.tech/tags/passwords.md>), [pmkid](<https://devfeed.tech/tags/pmkid.md>), [rsn](<https://devfeed.tech/tags/rsn.md>), [rsn-pmkid](<https://devfeed.tech/tags/rsn-pmkid.md>), [wifi-hacking](<https://devfeed.tech/tags/wifi-hacking.md>), [wireless-security](<https://devfeed.tech/tags/wireless-security.md>), [wpa](<https://devfeed.tech/tags/wpa.md>), [wpa2](<https://devfeed.tech/tags/wpa2.md>)

### AI overview

This tutorial explains new WiFi features in bettercap, including automated EAPOL handshake capture and a PMKID client-less attack against WPA/WPA2 access points. It also covers deauthentication-based capture workflows and preparing captured files for hashcat password cracking.

### Source excerpt

In this post, I'll talk about the new WiFi related features that have been recently implemented into bettercap, starting from how the EAPOL 4-way handshake capturing has been automated, to a whole new type of attack that will allow us to recover WPA PSK passwords of an AP without clients. We'll start with the assumption that your WiFi card supports monitor mode and packet injection (I use an AWUS1900 with this driver), that you have a working hashcat (v4.2.0 or higher is required) installation (ideally with GPU support enabled) for cracking and that you know how to use it properly either for dictionary or brute-force attacks, as no tips on how to tune the masks and/or generate proper dictionaries will be given :) On newer macOS laptops, the builtin WiFi interface `en0` already supports monitor mode, meaning you won't need a Linux VM in order to run this :)

## SSL fingerprinting for p0f

DevFeed: [SSL fingerprinting for p0f](<https://devfeed.tech/articles/ssl-fingerprinting-for-p0f-38906.md>)

Original publisher: [Read original article](<https://idea.popcount.org/2012-06-17-ssl-fingerprinting-for-p0f>)

Author: Marek

Published: 2012-06-16T22:00:00Z

Content type: article

Language: en

Sources: [Marek Majkowski](<https://devfeed.tech/sources/marek-majkowski.md>)

Topics: [SSL](<https://devfeed.tech/topics/ssl.md>), [HTTP](<https://devfeed.tech/topics/http.md>), [TCP/IP](<https://devfeed.tech/topics/tcp-ip.md>), [browser](<https://devfeed.tech/topics/browser.md>), [Chrome](<https://devfeed.tech/topics/chrome.md>), [Firefox](<https://devfeed.tech/topics/firefox.md>)

Tags: [chrome](<https://devfeed.tech/tags/chrome.md>), [compression](<https://devfeed.tech/tags/compression.md>), [firefox](<https://devfeed.tech/tags/firefox.md>), [handshake](<https://devfeed.tech/tags/handshake.md>), [handshakes](<https://devfeed.tech/tags/handshakes.md>), [http](<https://devfeed.tech/tags/http.md>), [ssl](<https://devfeed.tech/tags/ssl.md>), [tcp-ip](<https://devfeed.tech/tags/tcp-ip.md>), [tls](<https://devfeed.tech/tags/tls.md>)

### AI overview

The article describes SSL/TLS fingerprinting for p0f. It explains how client cipher suites, extensions, ordering, protocol versions, and other handshake details can identify SSL clients such as browsers, and discusses a p0f module that matches generated fingerprints against predefined signatures.

### Source excerpt

SSL fingerprinting for p0f In January Lcamtuf announced a complete rewrite of his passive fingerprinting tool p0f. Historically p0f was a low-level tool focused on fingerprinting layer 4, mostly and TCP/IP packets. The new version of p0f is different: not only it can look at low level packets, but also it is capable of fingerprinting higher-level application protocols. Currently it is able to do HTTP fingerprinting and the author suggests other protocols might soon follow.

## Handshake Lemma

DevFeed: [Handshake Lemma](<https://devfeed.tech/articles/handshake-lemma-40258.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2012/01/29/handshake-lemma/>)

Published: 2012-01-29T22:24:31Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Graphs](<https://devfeed.tech/topics/graphs.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>)

Tags: [graph](<https://devfeed.tech/tags/graph.md>), [graph-theory](<https://devfeed.tech/tags/graph-theory.md>), [handshake](<https://devfeed.tech/tags/handshake.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>)

### AI overview

The article proves the Handshake Lemma: in a party of n people, the number of people with an odd number of friends must be even. It uses double-counting to show that the sum of all friendship counts equals twice the total number of friendships, and then relates the result to graph theory.

### Source excerpt

Problem: Prove or disprove: at a party of $ n$ people, there must be an even number of people who have an odd number of friends at the party. Solution: Let $ P$ be the set of all people, and for any person $ p \in P$, let $ d(p)$ be the number of friends that person has. Let $ f$ be the total number of friendships between pairs of people at the party.