BEGIN:VCALENDAR
X-WR-TIMEZONE:America/Chicago
PRODID:-//University of Iowa//Events 1.0//EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTSTAMP:20211129T135535Z
DTSTART:20210914T153000
DTEND:20210914T162000
SUMMARY:GAUSS Seminar: Rotation Symmetric Boolean Functions and its Matrix
DESCRIPTION:Abstract\n\nDigital signatures are an important feature in any encryption/decryption scheme\, as it provides a message with integrity\, authenticity\, and nonrepudiation. The problem occurs when long messages are being exchanged and signatures that are just as long need to be verified. By using hash functions\, a ”fingerprint” of the message can be used instead of the message itself for verification\, making the process computationally inexpensive. If we consider a single iteration of a general hashing algorithm\, we see that there may be functions that allow for more efficient evaluation. This is when Rotation Symmetric Boolean Functions were studied more deeply. My research is on a matrix that comes up when studying these functions\, and trying to answer a specific question about this function. \n\nSpeaker\n\nManuel Albrizzio\, UI Mathematics PhD student\n\nLocation: \n\nSH 176 and Online (See url)\n\nHosts: \n\nPraneel Samanta & Nitesh Mathur (UI Mathematics)\n\nGAUSS will meet Tuesdays at 3:30-4:20 PM in Fall 2021.\n\n\nhttps://events.uiowa.edu/54930
LOCATION:Schaeffer Hall\, 176\, 20 East Washington Street\, Iowa City\, IA 52240
UID:edu.uiowa.events-prod-54930
X-ALT-DESC;FMTTYPE=text/html:### Abstract

\n\nDigital signatures are an important feature in any encryption/decryption scheme\, as it provides a message with integrity\, authenticity\, and nonrepudiation. The problem occurs when long messages are being exchanged and signatures that are just as long need to be verified. By using hash functions\, a ”fingerprint” of the message can be used instead of the message itself for verification\, making the process computationally inexpensive. If we consider a single iteration of a general hashing algorithm\, we see that there may be functions that allow for more efficient evaluation. This is when Rotation Symmetric Boolean Functions were studied more deeply. My research is on a matrix that comes up when studying these functions\, and trying to answer a specific question about this function.

\n\n### Speaker

\n\nManuel Albrizzio\, UI Mathematics PhD student

\n\n**Location: **

\n\nSH 176 and Online (See url)

\n\n### Hosts:

\n\nPraneel Samanta &\; Nitesh Mathur (UI Mathematics)

\n\n**GAUSS will meet Tuesdays at 3:30-4:20 PM in Fall 2021.**

\n

https://events.uiowa.edu/54930
END:VEVENT
END:VCALENDAR