
A Formal Analysis of Karn’s Algorithm
In this guest post, Max von Hippel provides an analysis of Karn’s Algorithm and the RTO computations described in RFC 6298.
Based in Boston MA
Articles
Likes on articles
Max von Hippel is an NSF GRFP fellow and PhD student in the Khoury College of Computer Science at Northeastern University, advised by Dr. Cristina Nita-Rotaru. His research focuses on the formal verification of, and automated synthesis of attacks against, network protocols. In his free time, Max co-organizes the Boston Computation Club (https://bstn.cc).
Website: https://mxvh.pl
In this guest post, Max von Hippel provides an analysis of Karn’s Algorithm and the RTO computations described in RFC 6298.
Showing 1 article(s)