4 citations · 10 across the 6 of their papers we have counts for
7 papers
S-CHIRP: Secure Communication for Heterogeneous IoTs with Round-Robin Protection
Mike Borowczak, George Purdy
This work introduces CHIRP - an algorithm for communication between ultra-portable heterogeneous IoT devices with a type of round-robin protection mechanism. This algorithm is pres…
The Secure Generation of RSA Moduli Using Poor RNG
George Purdy
We discuss a procedure, which should be called Lenstra's fix, for producing secure RSA moduli even when the random number generation is very poor.
A Pseudoline Counterexample to the Strong Dirac Conjecture
Ben D. Lund, George B. Purdy, Justin W. Smith
We demonstrate an infinite family of pseudoline arrangements, in which an arrangement of n pseudolines has no member incident to more than 4n/9 points of intersection. This shows t…
Collinearities in Kinetic Point Sets
Ben D. Lund, George B. Purdy, Justin W. Smith +1
Let be a set of points in the plane, each point moving along a given trajectory. A {\em -collinearity} is a pair of a line and a time such that conta…
A Bichromatic Incidence Bound and an Application
Ben D. Lund, George B. Purdy, Justin W. Smith
We prove a new, tight upper bound on the number of incidences between points and hyperplanes in Euclidean d-space. Given n points, of which k are colored red, there are O_d(m^{2/3}…
On Finding Ordinary or Monochromatic Intersection Points
George B. Purdy, Justin W. Smith
An algorithm is demonstrated that finds an ordinary intersection in an arrangement of lines in , not all parallel and not all passing through a common point, in t…