Our regular Crypto Café seminars take place every other Thursday,10 am-10:50 am during the semester. We invite local and international experts on topics in Mathematics and Computer Science related to Cryptography and Information Security.
Come and join us for freshly brewed coffee and interesting conversations on the most exciting topics in cryptography.
Where: SE-43 (Charles E. Schmidt College of Science) - Room 215 and via Zoom
You can catch up on any missed meetings by following the below link:
Fall, 2024 Crypto Cafe Schedule:
December 5, 2024, 10:00 am +Zoom (click here)
Speaker: TBA FLYER
Title: TBA
Abstract: TBA
November 14, 2024, 10:00 am +Zoom (click here)
Speaker: Merey Sarsengeldin, Visiting Scholar, Department of Mathematics, University of Central Florida FLYER
Title: Variational Quantum Neural Network for modeling and solving Heat and Mass transfer problems.
Abstract: In this study we present a hybrid quantum-classical neural network (Variational Quantum Algorithm) to model and solve heat and mass transfer problems. The underlying PDEs responsible for modeling diverse phenomena are Stefan Type Problems. These problems are nonlinear where along with the unknown temperature function unknown boundary or flux function has to be determined. This kind of Free Boundary Value Problems are hard to solve analytically. To solve such kind problems analytically and numerically, we benefit from computational power of Quantum Computing and utilize neural networks as a universal function approximator to find the Heat function and Moving Phase boundary. On the basis of the Variational Quantum Neural Network, we have developed methodological framework and software artifact which might be of interest and beneficial for researchers and engineers working in the field of modeling Heat and Mass transfer phenomena.
October 31, 2024, 10:00 am
Speaker: Dr. Francesco Sica, Assistant Professor, Florida Atlantic University FLYER
Title: Group Actions and the Discrete Log Problem
Abstract:
The discrete logarithm problem (DLP) asks to compute, in a cyclic group $G=\langle g \rangle$, given $x\in G$ and $y= x^k$, the exponent $k$. This problem can be generalized to a situation when $G$ acts on a set $X$, and gives rise to the analogous vectorization problem (VP), asking to recover $\gamma\in G$ from knowledge of $x\in X$ and $y=\gamma \cdot x$.
We will discuss generic algorithms to solve the VP, in particular in the presence of hints $z=\gamma^d \cdot x$, rephrasing a 2006 argument of Cheon.
