Poughkeepsie Chapter of the Association For Computing Machinery

         AAA         CCCCCCC      MMMMM   MMMMM
       A   A       CC     CC     MM MM   MM MM
     AA   AA      CC      C     MM  MM MM  MM
   AAAAAAAAA     CC            MM   MMM   MM
  AA     AA     CC      C     MM    M    MM
 AA     AA     CC     CC     MM         MM
AA     AA      CCCCCCCC     MM         MM
ACM Chapter logo


Matrix Methods for Private Key Cryptography


Frank Rubin


Monday, April 23, 2018       7:30 PM


Marist College, Hancock Center (Building 14 on map), Room 2023. Park just north of Hancock Center, or in parking lot on south-east corner of Route 9 and Fulton Street. We thank Marist College for hosting the chapter's meetings.

More Information

This program is free and open to the public. Attendees should RSVP at Meetup.com.

All are welcome to join us beforehand for dinner at the Palace Diner at 6:00 PM.

For further information, go to Pok.ACM.org (QR code below):

QR code RSVP to ACM Poughkeepsie at   Meetup.com

About the Topic

Private Key cryptography has significant advantages over both Secret Key cryptography and Public Key cryptography. Secret Key cryptography requires that both parties have the same secret key, hence there needs to be a mechanism for distributing the secret keys. Public Key cryptography requires that each party knows the public key of the other party, hence there needs to be a mechanism for distributing the public keys.

In Private Key cryptography each party uses a private key unknown to the other party. There is no need to ever distribute these keys. Keys may be generated at will and discarded after one use.

Private Key cryptography can be achieved using the Three-Pass Protocol and matrix multiplication. Encryption, decryption and key-generation are as fast and simple as matrix multiplication, and there is no need to use numbers any larger than 8 bits. The matrix multiplication can also be used to establish secure keys for conventional cryptography, such as AES.

About the Speaker

Frank Rubin has an M.S. in Mathematics and a Ph.D. in Computer Science. He worked as a programmer for IBM in Design Automation from 1964 to 1991. He originated many of the algorithms still used for laying out and wiring chips and circuit boards.

He has been involved in cryptography since high school. He has been an editor of the hobbyist publication The Cryptogram, and the professional journal Cryptologia. He teaches a course on cryptography at Marist CLS (Continuing Life Studies). He is also the author or inventor of thousands of puzzles, some of which can be found on his websites.

To Print this Announcement