ACC Seminar: Cayley Hash Functions and Random Products of Matrices
Department of Mathematical Sciences
Location: North Building Room 316 and Zoom (Passcode: ACC)
Speaker: Vladimir Shpilrain, Professor, The City College of New York (CCNY)
ABSTRACT
Cayley hash functions are based on a simple idea of using a pair of semigroup elements, A and B, to hash the 0 and 1 bit, respectively, and then to hash an arbitrary bit string in the natural way, by using multiplication of elements in the semigroup.
When A and B are matrices over Z_p, security properties of the corresponding Cayley hash function motivate various interesting questions about (random or not) products of matrices over Z, including the average and generic rate of growth of the norm of a random product of matrices.
BIOGRAPHY
Vladimir Shpilrain is Professor of Mathematics at the City College of New York. He received his PhD from the Lomonosov Moscow State University under the direction of Alfred Lvovich Shmelkin. Professor Shpilrain's research interests include combinatorial and computational group theory, information security, and complexity of algorithms.
Attendance: This is a technical talk open to all.
A campus map is available at https://tour.stevens.edu.
Additional information is available at https://web.stevens.edu/algebraic/.
At any time, photography or videography may be occurring on Stevens’ campus. Resulting footage may include the image or likeness of event attendees. Such footage is Stevens’ property and may be used for Stevens’ commercial and/or noncommercial purposes. By registering for and/or attending this event, you consent and waive any claim against Stevens related to such use in any media. See Stevens' Privacy Policy for more information.