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

Topic

Solving Linear Congruences

Speaker

Frank Rubin

When

Monday,       7:30 PM

Where

In cyberspace. To obtain the URL for this video conference, you must register to attend through the Meetup.com announcement. Meetup.com/ACM-Poughkeepsie. Once you've done so, your Zoom link will appear on Meetup's page for this event.

More Information

This program is free and open to the public. Because our meeting is virtual, we will not hold our normal dinner beforehand at the Palace Diner.

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

QR code RSVP to ACM Poughkeepsie at   Meetup.com

About the Topic

With the growing use of public key cryptography, the need to produce public/private key pairs is ever-increasing. As the ability to factor large numbers improves, the prime numbers which are used get ever-larger. Key pairs are created by generating very large primes, and then finding their inverses. Finding these inverses is a special case of solving a linear congruence. Fast algorithms are needed for generating the key pairs efficiently.

About the Speaker

Frank Rubin has an M.S. in mathematics, and a Ph.D. in computer science. He has been involved with computers for more than 60 years, and with cryptography for even longer. He is the owner of Master Software Corporation, which produces high-security encryption software. He is the author of the book Unbreakable Cryptography.

To Print this Announcement