Derek Atkins

Learn More
bu are given two integers, a and b, and ' asked to compute their product, ab = c. An algorithm for this task is taught in the early primary grades. For those of us who were day dreaming in class that day, a computer implemen tation of the algorithm yields an answer in micro seconds, even if a and b are rather large numbers, say 60 or 70 decimal digits. Now(More)
We describe the computation which resulted in the title of this paper. Furthermore, we g i v e an analysis of the data collected during this computation. From these data, we derive the important o b s e r v ation that in the nal stages, the progress of the double large prime variation of the quadratic sieve integer factoring algorithm can more eeectively be(More)
Lemieux as a protocol suitable for use on platforms with constrained computational resources, such as FPGAs, ASICs, and wireless sensors. It is a group-theoretic cryptographic protocol that allows two users to construct a shared secret via a Diffie–Hellman-type scheme over an insecure channel. Building on the refuted 2012 permutation-based attack of(More)
The Algebraic Eraser Diffie–Hellman (AEDH) protocol, first introduced in 2005 as a key agreement and authentication protocol, has been proposed as a standard in ISO JTC-1/SC-31 (29167-20) to protect various communication protocols like RFID, NFC, or Bluetooth for devices associated with ISO-18000 and the Internet of Things. A recent paper by M.J.B. Robshaw(More)
  • 1