2024-25 Department of Mathematics and Statistics Events |
|
|
March, 2025 |
|
March 3-7 |
56th Southeastern International Conference on Combinatorics, Graph Theory, and Computing Celebrating its 56th year, the Conference brings together mathematicians and others interested in combinatorics, graph theory, and computing, and their interactions. The Conference lectures and contributed papers, as well as the opportunities for informal conversations, have proven to be of great interest to other scientists and analysts employing these mathematical sciences in their professional work in business, industry, and government. The Conference continues to promote a better understanding of the roles of modern applied mathematics, combinatorics, and computer science to acquaint the investigator in each of these areas with the various techniques and algorithms, which are available to assist in his or her research. Each discipline has contributed greatly to the others, and the purpose of the Conference is to decrease even further the gaps between the fields. |
|
Monday |
The FAU SIAM (Society for Industrial and Applied Mathematics) Student Chapter Speaker: Deepak Bastola TItle: Wildfire Danger Prediction and Understanding With Deep Learning |
|
Tuesday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Thursday
|
Speaker: Dipayan Das, Ph.D., Florida Atlantic University
Title: Cryptanalysis of some Lattice-based Assumptions These assumptions have been used extensively for various lattice-based constructions, including encryptions, fully homomorphic encryptions, signatures, signature aggregations, etc. Bio: Dipayan Das is an Assistant Professor in the Florida Atlantic University Department of Mathematics and Statistics. Previously, he was a Postdoc researcher at the NTT Social Informatics Laboratories in Japan. Before that, he was a PostDoc researcher at CISPA Helmholtz center for information security in Germany. He did his PhD at the National Institute of Technology, Durgapur in India. |
|
Thursday |
Analysis and Applications Speaker: Papiya Bhattacharjee, Ph.D., Florida Atlantic University Title: Priestley Duality Abstract: A lattice is a partially ordered set in which every finite subset has both a least upper bound (supremum) and a greatest lower bound (infimum). The talk will focus on Distributive Lattice Theory, Boolean Algebra, and various Duality theories of lattices. We'll begin by exploring the basic structures of lattices, including ideals and filters. Next, we will cover the basics of Boolean Algebra and some of its properties. The discussion will then move to Stone's representation theorem for Boolean Algebras and conclude with Priestley Duality. |
|
Friday |
Student Chapters of AWM (Association of Women and Mathematics), SIAM, (Society of Industrial and Applied Mathematics), and Math Club Join the Department of Mathematics and Statistics' Student Chapters for Pi Day! Come and celebrate! There will be games food, drinks, some friendly cometition, and Pie. FLYER See you there! |
|
Monday |
SIAM Reading Group Speaker : Matthew Trang Topic : Introduction to Machine Learning |
|
Monday |
MS Thesis Defense Speaker: Connor Watson, MS Candidate Title: The Consistency Strength of the Generalized Continuum Hypothesis Failing at a Measurable Cardinal https://fau-edu.zoom.us/j/83623688212?pwd=fz1RaS8SbuoabkqFBHKISX9h1YnV0r.1 All are invited to attend |
|
Tuesday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Monday |
The FAU SIAM (Society for Industrial and Applied Mathematics) Student Chapter Speaker: Matthew Trang TItle: [Tentative] Controlling Visually Guided Behavior by Holographic Recalling of Cortical Ensembles |
|
Tuesday
|
Math Club Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Wednesday
|
Colloquium Speaker: Shuhong Gao, Ph.D.; Clemson University Title: Security Problems in Lattices Abstract: Lattices play a critical role in several areas, including number theory and post-quantum cryptography. In this talk, I will discuss the computational complexity of various lattice problems, with a focus on the Shortest Vector Problem (SVP), the Smallest Integer Solutions (SIS) problem and the Learning with Errors (LWE) problem—three challenges that underpin the hardness assumptions of many cryptographic protocols. I will examine the interplay between average-case and worst-case complexities, highlighting how these distinctions impact both theoretical analysis and practical security. Furthermore, I will introduce a new method for solving LWE over the reals using Singular Value Decomposition (SVD), running in polynomial time on the average-case. |
|
Thursday |
Speaker: Merve Karabulut (FAU) Title: Efficient CPA Attack on Hardware Implementation of ML-DSA in Post-Quantum Root of Trust Abstract: Side-channel attacks (SCA) present a serious threat to cryptographic implementations, including those designed for post-quantum security. This talk introduces the first Correlation Power Analysis (CPA) attack on an industry-grade hardware implementation of ML-DSA within a Silicon Root of Trust framework. Our attack exploits side-channel leakage from the modular reduction process following the Number Theoretic Transform-based polynomial multiplication. By leveraging leakage from a unique reduction algorithm and the zeroization mechanism used for securely erasing sensitive data, we demonstrate secret key extraction using only 10,000 power traces. This attack compromises the integrity of the root of trust, enabling signature forgery for certificate generation. Our findings highlight critical vulnerabilities in commercially deployed post-quantum cryptographic systems and emphasize the need for robust countermeasures. |
|
Thursday |
Analysis and Applications Speaker: Robert Lubasrsky, Ph.D., Florida Atlantic University Title: The Reverse Mathematics of Harrington's Principle Abstract: One major goal of set theory was to provide a unified framework in which one can do all of mathematics. This works fine for naive set theory, but once set theory becomes formal and rigorous, questions readily emerge about the universe of sets. At first blush, it seems that the impact of set-theoretic issues in mainstream mathematics would be limited. But is that really so? Time permitting, we will get far enough to talk about the subjects in the title. |
|
|
February 2025 |
|
Tuesday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Friday |
Association for Women in Mathematics (AWM) FAU's Student Chapter FAU's Student Chapter of the AWM presents "An Afternoon Tea Time!" (flyer) Please join us for a cup of tea, cookies, and conversation about mathematics. All are cordially invited! |
|
Saturday
|
High School Math Day Registration is now open! Please visit: https://math.fau.edu/mathday/index.php |
|
Tuesday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Thursday |
Speaker: Ivana Trummová, Ph.D. candidate, Czech Technical University (CTU) in Prague, Czech Republic FLYER Title: Human Factors in Cryptography Abstract: Cryptography can be considered a part of mathematics or computer science, therefore an exact and technical field. On the other hand, cryptography is created, implemented and used by people, who have to collaborate, communicate, and are prone to making mistakes. In my work, I am researching the non-technical aspects of cryptography that affect security. In one of my previous projects we have mapped the cryptography ecosystem, described the systemic barriers that hinder cryptography adoption. In another interview study, we found out how developers implement cryptographic standards and how an ideal standard specification should look like. Now I am studying the processes of cryptography competitions and their impacts on cryptographic community. Speaker Bio: Ivana Trummová is a cryptography researcher and a teacher focusing on human factors in security and inter-disciplinary research. She is currently pursuing a PhD in Cryptography at the Faculty of Information Technology, Czech Technical University (CTU) in Prague, Czech Republic. She also works as a teacher assistant at CTU, teaching courses on cryptography, mathematics and cybersecurity, and recently also a new course called "Human Factors in Cryptography and Security", which aims to bring an inter-disciplinary point of view to computer science students. |
|
Thursday |
Analysis and Applications Speaker: Necibe Tuncer, Ph.D., Florida Atlantic University Title: Understanding Usutu Virus Dynamics: Effects of Data and Model Structure Across Biological Scales Abstract: Understanding the epidemiology of emerging pathogens, such as Usutu virus infections, requires systems investigation at each scale involved in the host-virus ecology, from individual bird infections to bird-to-vector transmissions to USUV incidence in bird and vector populations and eventually to spillover probability in humans. For new pathogens, wild data is sparse, and predictions are based on laboratory-type inoculation and transmission experiments combined with dynamical mathematical modeling. In this study, we developed a multiscale vector-borne epidemiological model of Usutu virus infection in birds and mosquitoes and used individual within-host viral load data and host-to-vector probability of transmission data to predict USUV incidence in bird and mosquito populations exposed to two different Usutu viral strains. We addressed the role of model structure, data uncertainty, and optimal experimental design on model predictions. We found that within-host peak viremia does not always correlate with infection incidence levels in host and vector populations and that uncertainty in predictions at one scale may change predicted results at another scale. We showed that optimal experimental design and increased frequency of data collection vastly improve these correlations. The results may be useful for predicting spillover events. |
|
Monday |
The FAU SIAM (Society for Industrial and Applied Mathematics) Student Chapter 3rd reading group this semester! Our mission is to foster interdisciplinary collaborations among undergraduate and graduate students across STEM fields. This time, we are hosting a miniseries of up to five talks focusing on machine learning (ML), ML model architectures, and their applications in fields such as biology, medical sciences, and geophysics. 📅 First Meeting: February 17, 2025 (Monday) 📅 Frequency: Every other Monday 🕒 Time: 4:00 – 5:00 PM 📍 Location: Science Building, Room SE 215 We’d love to hear from you! Refreshments and snacks will be provided at each meeting. If you're interested in joining, please reply to siam@fau.edu . For any questions, feel free to reach out via email or contact our SIAM faculty advisor, Dr. Francis Motta (fmotta@fau.edu). Looking forward to seeing you there! |
|
Tuesday |
Today's event: Euler, Riemann, and the Million Dollar Question, Dr. Tomas Schonbek Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Thursday |
Analysis and Applications
Speaker: Jason Mireles-James, Ph.D., Florida Atlantic University Title: Introduction to the Birkhoff Normal Form Part II Abstract: I'll define the Birkhoff normal form (BNF) and discuss some of its properties. Then I'll discuss and iterative computational method for the BNF due to Amedu Delshams and J. Tomas Lazaro and illustrate its use in a celestial mechanic problem. |
|
Feb. 24 |
Florida GeoGebra Conference Registration link: https://fau.az1.qualtrics.com/jfe/form/SV_0cguWFiDo2UO2pg Description: Florida GeoGebra Conference February 24, 2025 Join us for an interactive workshop designed for STEM educators seeking to enhance their teaching of mathematics through the innovative use of GeoGebra. GeoGebra is a dynamic mathematics software that integrates geometry, algebra, spreadsheets, graphing, statistics, and calculus. In this workshop, we will explore how to leverage GeoGebra to create engaging and effective learning experiences in your STEM classroom. Workshop Highlights:
Who Should Attend:
Coffee and lunch will be provided! For more information, please contact: Dr. Katarzyna Winkowska-Nowak, Director of MST |
|
Monday |
The FAU SIAM (Society for Industrial and Applied Mathematics) Student Chapter
Speaker:
Matthew Trang
Title: Introduction to Machine Learning (cont’d) |
|
Tuesday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Thursday |
Speaker: Dominic Gold (Johns Hopkins University Applied Physics Laboratory) FLYER Title: Deterministic Random Bit Generators in Cryptography Abstract: Side-channel attacks (SCA) present a serious threat to cryptographic implementations, including those designed for post-quantum security. This talk introduces the first Correlation Power Analysis (CPA) attack on an industry-grade hardware implementation of ML-DSA within a Silicon Root of Trust framework. Our attack exploits side-channel leakage from the modular reduction process following the Number Theoretic Transform-based polynomial multiplication. By leveraging leakage from a unique reduction algorithm and the zeroization mechanism used for securely erasing sensitive data, we demonstrate secret key extraction using only 10,000 power traces. This attack compromises the integrity of the root of trust, enabling signature forgery for certificate generation. Our findings highlight critical vulnerabilities in commercially deployed post-quantum cryptographic systems and emphasize the need for robust countermeasures. |
|
|
January 2025 |
|
Tuesday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Thursday |
Speaker: Edoardo Persichetti, Ph.D. Florida Atlantic University FLYER Title: On Digital Signatures from Cryptographic Group Actions Abstract: Cryptography based on group actions has been studied for a long time. In recent years, however, the area has seen a revival, partially due to its role in post-quantum cryptography. In this talk, we present our work on a unified taxonomy of a variety of techniques used to design digital signature schemes. We describe all techniques in a single fashion, show how they impact the performance of the resulting protocols and analyse how different techniques can be combined for optimal performance. Join on Zoom +Zoom (click here) Everyone welcome! |
|
Tuesday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Thursday |
Analysis and Applications Seminar Speaker: Jason Mireles-James, Ph.D; Florida Atlantic University Title: Introduction to the Birkhoff Normal Form. Abstract: I'll start by reviewing some basic linearization results for equilibrium solutions of systems of autonomous differential equations (i.e. vector fields). I'll try to explain what can go wrong when the spectrum of the derivative has eigenvalues on the imaginary axis, and then talk about what we can do about it. For a four dimensional Hamiltonian vector field, the Birkhoff Normal Form (BNF) is a tool which can be applied in one of the center cases (and one hyperbolic cases which is still ``resnoant'') and which is in some ways ``as good'' as a linearization. I'll discuss a modern approach to the BNF due to Delshams, and show some numerical results from a numerical implementation based on his approach |
|
Saturday |
AMC8 Middle School Math Day For information, please visit: https://math.fau.edu/amc-contests/amc8.php |
|
Tuesday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Thursday |
Speaker: Eliana Carozza (PhD researcher at IRIF, Université Paris Cité, France) Title: Faster Signatures from MPC-in-the-Head Abstract: The construction of signature schemes using the MPC-in-the-head paradigm is revisited, leading to two main contributions: – It is observed that prior signatures within the MPC-in-the-head paradigm require a salted version of the GGM puncturable pseudorandom function (PPRF) to mitigate collision attacks. A new efficient PPRF construction is presented, which is provably secure in the multi-instance setting. The security analysis, conducted in the ideal cipher model, represents a core technical contribution. Unlike previous constructions that relied on hash functions, the proposed PPRF uses only a fixed-key block cipher, resulting in significant efficiency gains, with speed improvements ranging from 12× to 55× for a recent signature scheme (Joux and Huth, Crypto’24). This improved PPRF has the potential to enhance the performance of various MPC-in-the-head signatures. – A new signature scheme is introduced, based on the regular syndrome decoding assumption and a novel protocol for the MPC-in-the-head paradigm. The proposed scheme achieves a substantial reduction in communication overhead compared to earlier works. Despite its conceptual simplicity, the security analysis involves intricate combinatorial considerations. |
|
Thursday |
Analysis and Applications seminar Speaker: Erik Lundberg, Ph.D., Florid Atlantic University
Title: Random Acyclic Orientations and the Length of the Longest Path |
|
|
December, 2024 |
|
Thursday |
Speaker: Abhraneel Dutta, Ph.D.; Florida Atlantic University Title: Polynomial Inversion Algorithms in Constant Time for Post-Quantum Cryptography Abstract: The computation of the inverse of a polynomial over a quotient ring or a finite field plays a very important role during the key generation of post-quantum cryptosystems like NTRU, BIKE, and LEDACrypt. It is therefore important that there exist an efficient algorithm capable of running in constant time, to prevent timing side-channel attacks. In this article, we study both constant-time algorithms based on Fermat's Little Theorem and the Extended GCD Algorithm, and provide a detailed comparison in terms of performance. According to our conclusion, we see that the constant-time Extended GCD-based Bernstein-Yang's algorithm shows a better performance with 1.76x-3.76x on x86 platforms compared to FLT-based methods. Although we report numbers from a software implementation, we additionally provide a short glimpse of some recent results when these two algorithms are implemented on various hardware platforms. Finally, we also explore other exponentiation algorithms that work similarly to the Itoh-Tsuji inversion method. These algorithms perform fewer polynomial multiplications and show a better performance with 1.56x-1.96x on x86 platform compared to Itoh-Tsuji inversion method. Join the faculty and students of Cryptography for a biweekly reading seminar on fully homomorphic encryption. |
|
Monday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Saturday |
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 7, 2024. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles |
|
|
November, 2024 |
|
Saturday |
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 7, 2024. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles |
|
Wednesday |
AMC-10/12 A A contest for High School Students Registration is now open. Please visit: https://math.fau.edu/amc-contests/am-math-comp.php |
|
Thursday |
Crypto Reading Seminar Join the faculty and students of Cryptography for a biweekly reading seminar on fully homomorphic encryption. |
|
Tuesday |
AMC-10/12 B A contest for High School Students Registration is now open. Please visit: https://math.fau.edu/amc-contests/am-math-comp.php |
|
Wednesday |
Speaker: Nicole Abreu, MS Candidate, Florida Atlantic University Title: Topological Machine Learning with Unreduced Persistence Diagrams Advisor: Dr. Francis Motta Co-Advisor: Dr. Parker Edwards Abstract: A common topological data analysis approach used in the experimental sciences involves creating machine learning pipelines that incorporate discriminating topological features derived from persistent homology (PH) of data samples, encoded in persistence diagrams (PDs) and associated topological feature vectors. Often the most computationally demanding step is computing PH through an algorithmic process known as boundary matrix reduction. In this work, we introduce several methods to generate topological feature vectors from unreduced boundary matrices. We compared the performance of classifiers trained on vectorizations of unreduced PDs to vectorizations of fully reduced PDs across several benchmark ML datasets. We discovered that models trained on PDs built from unreduced diagrams can perform on par and even outperform those trained on full-reduced diagrams. This observation suggests that machine learning pipelines which incorporate topology-based features may benefit in terms of computational cost and performance by utilizing information contained in unreduced boundary matrices. A common topological data analysis approach used in the experimental sciences involves creating machine learning pipelines that incorporate discriminating topological features derived from persistent homology (PH) of data samples, encoded in persistence diagrams (PDs) and associated topological feature vectors. Often the most computationally demanding step is computing PH through an algorithmic process known as boundary matrix reduction. In this work, we introduce several methods to generate topological feature vectors from unreduced boundary matrices. We compared the performance of classifiers trained on vectorizations of unreduced PDs to vectorizations of fully reduced PDs across several benchmark ML datasets. We discovered that models trained on PDs built from unreduced diagrams can perform on par and even outperform those trained on full-reduced diagrams. This observation suggests that machine learning pipelines which incorporate topology-based features may benefit in terms of computational cost and performance by utilizing information contained in unreduced boundary matrices. Please contact Dr. Hongwei Long <hlong@fau.edu> for an electronic copy of the thesis. All are cordially invited. |
|
Wednesday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Thursday |
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. |
|
Saturday |
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 7, 2024. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles |
|
Monday |
PhD Dissertation Defense Speaker: Emrah Karagoz, PhD Candidate Title: An Investigation on Practical Aspects of Post-Quantum Cryptography Advisor: Dr. Edoardo Persichetti Co-advisor: Dr. Koray Karabina Abstract: The security of the current public-key cryptographic schemes, based on integer factorization and discrete logarithm problems, is expected to be totally broken with the development of quantum computers utilizing Shor's algorithm. As a result, The National Institute of Standards and Technology (NIST) initiated the Post-Quantum Cryptography (PQC) standardization process in 2016, inviting researchers to submit candidate algorithms that are both resistant to quantum attacks and efficient for real-world applications. Researchers have since studied various different aspects of the candidate algorithms, such as their security against quantum attacks and their efficient implementation on different platforms. In this thesis, we investigate the practical aspects of Post-Quantum Cryptography and contribute to several topics. First, we focus on the knapsack problem and its security under classical and quantum attacks. Second, we improve the secure biometric template generation algorithm NTTSec, proposing an enhanced version, NTTSecR, and providing an in-depth design and security analysis. Third, we work on optimizing implementations of the post-quantum secure signature scheme LESS and polynomial inversion algorithms for code-based schemes. Finally, we analyze a proposed countermeasure for the exposure model of SIKE, the isogeny-based scheme that was a candidate in NIST’s Round 4. All are cordially invited. |
|
Thursday |
Crypto Reading Seminar Join the faculty and students of Cryptography for a biweekly reading seminar on fully homomorphic encryption. |
|
Monday |
MS Exam Speaker: Jia Wei Chen, Master's of Science degree candidate, Florida Atlantic University Title: Computation of VaR in Large Complex Portfolios: Saddle-point Approximation Method Abstract: The presentation explores an improvement in terms of computational efficiency for calculating Value-at-Risk (VaR) in large complex portfolios evaluated by nonlinear return functions (e.g. when security derivatives are held in the portfolio). One approach is to use Monte Carlo simulation to estimate VaR which is computationally expensive for portfolios with large size of underlying assets. Even when the return function is approximated by taking the second order Taylor expansion (delta-gamma approximation), the computation of Monte Carlo simulation can be still very demanding. To overcome this challenge, Feuerverger and Wong proposed an approximation technique, leveraging the delta-gamma framework to model both linear and nonlinear sensitivities within the portfolio. In this presentation, we will break down the delta-gamma and saddle-point approximations, explain how the saddle-point approximations are used, and highlight the advantages of this approach over Monte Carlo simulation. All are cordially invited. |
|
Wednesday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Saturday |
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 7, 2024. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles |
|
|
October, 2024 |
|
Wednesday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Thursday |
Crypto Café Speaker: Dr. Veronika Kuchta, Assistant Professor, Florida Atlantic University FLYER Title: Proximity gaps for Reed-Solomon Codes and their Application in Interactive Oracle Proofs of Proximity and ZK-SNARKs Abstract: Reed-Solomon codes have long been a fundamental tool of error correction and data integrity, but their applications extend far beyond traditional coding theory. In this talk, I will explore the concept of proximity gaps within Reed-Solomon codes—specific measures of how far a received word is from the closest codeword—and their critical role in the design and analysis of advanced cryptographic protocols, such as Zero-Knowledge Succinct Non-Interactive Arguments of Knowledge (ZK-SNARKs) and Interactive Oracle Proofs of Proximity (IOPPs). |
|
Thursday |
Analysis and Applications Speaker: Professor Tomas Schonbek, Florida Atlantic University Title: The Helmholtz decomposition Mini-abstract: I will discuss the Helmholtz decomposition of a vector field into a gradient and a divergence free vector field, a fundamental tool in fluid dynamics, and give my take on the proof. |
|
Friday |
Math Colloquium Speaker: Sri Namachchivaya, Professor, University of Waterloo Title: Random and Data Driven Dynamical Systems Abstract: I will present a general overview of several engineered and natural systems with uncertain mathematical models, the multidisciplinary methods required for their analysis, and relevant results. The collection of new mathematical techniques that I will describe lies at the confluence of three important areas: dynamical systems; control and estimation (data assimilation); and information theory. The first part of the talk focuses on the challenges in data assimilation that arise from the interactions between uncertainties, nonlinearities, and observations. I will present rigorous reduced-order data assimilation techniques for high dimensional multi-scale problems. In particular, I will outline how scaling interacts with filtering via stochastic averaging. Optimal sensor placement based on information theoretic concepts will also be discussed. The second part of the talk deals with the almost-sure stability of a noisy nonlinear autoparametric system. This work brings together two interesting themes in dynamical systems — resonances and Lyapunov exponents. The subtleties of their interactions are explored in a canonical way by combining the ideas from dynamical systems and the Oseledets multiplicative ergodic theory. — Joint work with Peter H. Baxendale (USC), Ryne Beeson (Princeton) and Nicolas Perkowski (Free University of Berlin). This talk is dedicated to the memory of the late Professor Yukweng Michael Lin, formerly Charles E. Schmidt Eminent Scholar Chair in Engineering and the Founding Director of FAU Center for Applied Stochastics Research, who was for more than 50 years a leading figure in stochastic and engineering mechanics. Refreshments including brownies cookies and coffee will be served! All are welcome! |
|
Saturday |
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 7, 2024. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles |
|
Thursday |
Crypto Reading Seminar Join the faculty and students of Cryptography for a biweekly reading seminar on fully homomorphic encryption. |
|
Wednesday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Thursday |
Speaker: Ruslan Ospanov, Eurasian National University, Kazakhstan Title: The MCDM-RL-based Framework for Consensus Protocol Selection for IoT networks. Abstract: This topic is a part of my PhD research topic: “Design and analysis of cryptographic algorithms and protocols for solving the problem of consensus in distributed ledger technologies”. Reinforcement learning (RL) has played a key role in the rapid development of artificial intelligence technologies that has been observed over the past decade. Reinforcement learning methods have shown impressive results in a range of fields. Specifically, RL is widely applied in robotics, control systems, and the Internet of Things (IoT) to address challenges in automation, optimization, and the management of complex systems. The IoT is also a major area for the implementation of distributed ledger and blockchain technologies, which provide effective solutions to overcome the limitations of conventional IoT applications. A key element of the distributed ledger reference architecture is the consensus layer, which handles agreement among network nodes, ensuring the ledger’s state remains consistent while maintaining data security, accuracy, and protection. The selection of a consensus protocol plays a crucial role in determining the performance and security of the blockchain system. This talk is devoted to the issue of selection a blockchain consensus protocol for IoT networks using the combined application of multi-criteria decision making (MCDM) and reinforcement learning (RL) methods. In this talk, I will consider an idea of integration multi-criteria decision making and reinforcement learning methods to blockchain consensus protocol selection for IoT. It proposes a combined consensus protocol selection and management system for IoT networks based on the multi-criteria decision making method and reinforcement learning. Bio: Ruslan Ospanov has been engaged in scientific and educational activities in the field of mathematics and cryptography for more than 20 years, has dozens of scientific and scientific-methodological works, as well as several copyright certificates from Qazpatent (National Institute of Intellectual Property of the Ministry of Justice of the Republic of Kazakhstan (NIIP)). He worked as a teacher in various universities of Kazakhstan (Karaganda State University named after academician E.A. Buketov, L.N. Gumilyov Eurasian National University and other). He is also a research fellow at the Research Institute of Information Security and Cryptology of L.N. Gumilyov Eurasian National University. Since September 2022, he has been a doctoral student at the Eurasian National University named after L.N. Gumilyov, specializing in Information Security Systems. |
|
Thursday |
Analysis and Applications Speaker: Jorge Gonzalez, Florida Atlantic University Title: Validated enclosure of renormalization fixed points Abstract: I will discuss recent work with Maxime Breden and Jason Mireles James where we develop a framework for proving existence, uniqueness, and stability results for real analytic fixed points of m-th order Feigenbaum-Cvitanović renormalization operators. The universality properties associated to the fixed points, first discovered by Feigenbaum for m=2 in the context of population dynamics, in general describe different routes to chaotic behavior in multiple contexts in Mathematics and the physical sciences. We obtain general formulas for the Jacobian of the mth order operator and use Chebyshev expansions to approximate the fixed points. The advantage of Chebyshev series is that they are naturally adapted to spaces of real analytic functions, in the sense that they converge on ellipses containing real intervals. We prove the existence of multiple renormalization fixed points of order m = 3, . . . , 10, and compute validated bounds on the values of their universal constants. We also reprove the existence of the classical m = 2 Feigenbaum renormalization fixed point and compute its universal constants to about 500 correct decimal digits. Preprint on arxiv: https://arxiv.org/pdf/2409.20457
|
|
Saturday |
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 7, 2024. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles |
|
Wednesday |
Analysis and Applications Speaker: Joseph Cummings (Notre Dame - Applied and Computational Mathematics & Statistics) Title: Algebraic Invariants of Level-1 Phylogenetic Networks Abstract: Algebraic techniques in phylogenetics have historically been successful at proving identifiability results and have also led to novel reconstruction algorithms. In this talk, we will find a Gröbner basis for the ideal of phylogenetic invariants of the Cavender-Farris-Neyman (CFN) model on level-1 phylogenetic networks, that is the vanishing ideal of the set of all possible probability distributions on the leaves arising from the model. We will show that the vanishing ideal can be completely determined by analyzing the covariance matrix instead of the whole probability distribution. Moreover, we will show that the ideal is cut out by 2 x 2 and 3 x 3 minors of the covariance matrix which can be determined from the topology of the network. This research is joint with Elizabeth Gross, Ben Hollering, Sam Martin, and Ikenna Nometa. |
|
Wednesday |
Crypto Seminar at New College Speaker: Edoardo Persichetti, Associate Professor, Florida Atlantic University Title: On Digital Signatures from Cryptographic Group Actions” Abstract: Cryptography based on group actions has been studied since 1990. In recent years, however, the area has seen a revival, partially due to its role in post-quantum cryptography. In this work, we present a unified taxonomy of a variety of techniques used to design digital signature schemes. We describe all techniques in a single fashion, show how they impact the performance of the resulting protocols and analyze in detail how different techniques can be combined for optimal performance. Everyone welcome! Seminar Locatiion: New College of Florida, Sarasota Zoom link https://ncf.zoom.us/j/92611790452?pwd=7QQ4l7n2NLhlU9qDjOWBnUugdjNW5u.1 |
|
Thursday |
Crypto Reading Seminar Join the faculty and students of Cryptography for a biweekly reading seminar on fully homomorphic encryption. The following paper will be discussed: |
|
Thursday |
Analysis and Applications Speaker: Jorge Gonzalez, Florida Atlantic University Title: Validated enclosure of renormalization fixed points Abstract: I will discuss recent work with Maxime Breden and Jason Mireles James where we develop a framework for proving existence, uniqueness, and stability results for real analytic fixed points of m-th order Feigenbaum-Cvitanović renormalization operators. The universality properties associated to the fixed points, first discovered by Feigenbaum for m=2 in the context of population dynamics, in general describe different routes to chaotic behavior in multiple contexts in Mathematics and the physical sciences. We obtain general formulas for the Jacobian of the mth order operator and use Chebyshev expansions to approximate the fixed points. The advantage of Chebyshev series is that they are naturally adapted to spaces of real analytic functions, in the sense that they converge on ellipses containing real intervals. We prove the existence of multiple renormalization fixed points of order m = 3, . . . , 10, and compute validated bounds on the values of their universal constants. We also reprove the existence of the classical m = 2 Feigenbaum renormalization fixed point and compute its universal constants to about 500 correct decimal digits. Preprint on arxiv: https://arxiv.org/pdf/2409.20457 |
|
Wednesday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Thursday |
Speaker: 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. |
|
|
September, 2024 |
|
Wednesday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Thursday |
Speaker: Dr. Edoardo Persichetti, Associate Professor, Florida Atlantic University FLYER Title: A Brief Introduction to Code-Based Cryptography Abstract: Code-based cryptographic primitives are among the main solutions for Post-Quantum Cryptography, the area of study in charge of protecting our information and communication in the presence of quantum adversaries. In this talk, I will briefly walk through the history of this field, highlighting the main constructions, modern approaches, and recent developments. Everyone welcome! |
|
Thursday |
Analysis and Applications Speaker: Professor Markus Schmidmeier, Florida Atlantic University Title: Invariant Subspaces of Nilpotent Operators Abstract: Related to the invariant subspace problem in functional analysis, but heading in a more algebraic direction, this talk concerns the linear algebra problem of classifying invariant subspaces of linear operators acting on finite dimensional vector spaces, (with no conditions on the underlying basefield or on the topology of the space). Dependent on certain dimensions, the subspaces may either be sparse (and we can describe them) or plentiful (in the sense that there are parametrized families of pairwise non-equivalent subspace embeddings). Joint work with Claus Michael Ringelfrom Bielefeld, Germany. |
|
Saturday |
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 7, 2024. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles |
|
Thursday |
Crypto Reading Seminar Join the faculty and students of Cryptography for a biweekly reading seminar on fully homomorphic encryption. |
|
Wednesday |
Join your friends and other math enthusiasts at FAU's Math Club events! The purpose of our Club is to improve academic ability, spread awareness of mathematics’ importance, and share a passion for all fields of mathematics! The club is open to all majors and all math backgrounds. Activities at the club will include:
Snacks are always available! See you there! |
|
Thursday |
Speaker: Dr. Shi Bai, Associate Professor, Florida Atlantic University FLYER Title: Lattice-based Cryptography: Construction and Analysis Abstract: Lattice-based Cryptography holds a great promise for post-quantum cryptography. It enjoys strong security based on the so-called worst-case to average-case redution; relatively efficient implementations, as well as algorithmic simplicity. In this talk, we will discuss a post-quantum scheme based on lattice; and several algorithms for evaluating the security of average-case/worst-case problems in lattice-based cryptography. |
|
Saturday |
Welcome to Math Circle! The main purpose of the circle is to have fun with mathematics while learning something in the process. We will be discussing and solving problems, having friendly competitions, playing mathematical games. The purpose of this circle is to amplify the mathematical knowledge of students who like math, and do it in a fun way, we will also look at some AMC problems, and see how what was seen in the circle applies. We will be meeting every other Saturday, beginning Saturday, September 7, 2024. It is important to emphasize what these circle meetings are NOT. They are not classes or lectures. Students are free to walk about and talk. Source of the Problems: The majority of problems will come from very diverse sources, old AMC competitions, the Moscow Math Circle Problem book, historical sources (for example Fibonacci's Liber Abaci), etc. A few will be made up by us. Sources will not usually be credited but credits will be revealed upon request, if we know the source. Registration is FREE! Register Here for Fall, 2024 Math Circles |
|
Thursday |
Crypto Reading Seminar Join the faculty and students of Cryptography for a biweekly reading seminar on fully homomorphic encryption. |
|
Friday |
Association for Women in Mathematics (AWM) FAU's Student Chapter FAU's Student Chapter of the AWM presents "An Afternoon Tea Time!" (flyer) Please join us for a cup of tea, cookies, and conversation about mathematics. All are cordially invited! |
|
|
August, 2024 |
|
Thursday |
Analysis and Algebra Seminar Speaker: Parker Edwards, Assistant Professor Title: On computing local monodromy (part IV) Abstract: A fundamental fact about zero sets of systems of polynomial equations over the complex numbers is that they decompose into a finite number of irreducible algebraic subsets. Knowing a thorough description of the irreducible components of an algebraic variety tells you quite a bit about it, and computing one is an essential preprocessing step to many numerical algorithms. Standard algorithms for computing this numerical irreducible decomposition combine some relatively sophisticated machinery. This week's talk will cover some background on monodromy actions and how they're used to detect irreducible components of algebraic varieties. A main component is computing the monodromy action of certain linear projection maps using numerical continuation. What if one is instead interested in studying the geometric properties of an algebraic variety localized at a point? This puts you into the realm of singularity theory in complex analytic geometry, which is a rich and ongoing area of theoretical development. Every zero set of a system of complex-valued analytic functions has a local irreducible decomposition at each point. Computing a corresponding numerical local irreducible decomposition is similarly essential to developing a local approach to numerical algebraic geometry. I will discuss some recent work with Jon Hauenstein which culminates in an algorithm for doing so. My aim for these seminars is to give a thorough enough overview of the background to understand what the algorithm is doing. If there's interest, we can discuss enough to get at the main ideas of the proof that it works. Here's the breakdown:
|
|
August, 5-9 |
Young Cryptographers Cybersecurity Summer Camp Young CryptograpHers is a Cybersecurity summer camp specially designed for high school students. Participants will be introduced to the fundamental principles of cybersecurity and learn how to apply conceptual knowledge to real-world situations. The camp will focus on Post-Quantum Cryptography, the area of math that is in charge of protecting our information in the era of quantum technology. The program includes lectures and activities by FAU faculty, alumni and speakers from industry and government. Our goal is to motivate and inspire talented students who are interested in a cybersecurity career. ( flyer ) |
|
Thursday |
Analysis and Applications Speaker: Turgay Bayraktar, Sabanci University (Istanbul) Title: Random Real Algebraic Geometry and Random Ameobas Abstract: Click here |
