Actions

Difference between revisions of "FPGAWorkshopMatt"

From HacDC Wiki

(Created page with 'I've got a couple of ideas so far: # WEP or WPA crack acceleration #* In my dreams, I imagine a crack accelerator embedded in an autonomous robot that drives itself around cracki…')
 
 
(3 intermediate revisions by one other user not shown)
Line 1: Line 1:
I've got a couple of ideas so far:
[[Category:FPGAWorkshop]]
# WEP or WPA crack acceleration
 
I've got a couple of ideas so far:  
# WEP or WPA (or other hash/cipher) crack acceleration
#* In my dreams, I imagine a crack accelerator embedded in an autonomous robot that drives itself around cracking networks as it goes.
#* In my dreams, I imagine a crack accelerator embedded in an autonomous robot that drives itself around cracking networks as it goes.
# non-von Neumann computer
# non-von Neumann computer
#* E.g., the Reduceron, which is a machine that does something called graph reduction, a thing computationally equivalent to a Turing machine but which is better suited to pure functional languages like Haskell
#* E.g., the Reduceron, which is a machine that does something called graph reduction, a thing computationally equivalent to a Turing machine but which is better suited to pure functional languages like Haskell
#* see http://www.cs.york.ac.uk/fp/reduceron/
#* see http://www.cs.york.ac.uk/fp/reduceron/
# SIP <-> analog telephone adapter

Latest revision as of 10:06, 3 April 2012


I've got a couple of ideas so far:

  1. WEP or WPA (or other hash/cipher) crack acceleration
    • In my dreams, I imagine a crack accelerator embedded in an autonomous robot that drives itself around cracking networks as it goes.
  2. non-von Neumann computer
    • E.g., the Reduceron, which is a machine that does something called graph reduction, a thing computationally equivalent to a Turing machine but which is better suited to pure functional languages like Haskell
    • see http://www.cs.york.ac.uk/fp/reduceron/
  3. SIP <-> analog telephone adapter