BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Bill Brumley (Tampere University)
DTSTART:20230213T163000Z
DTEND:20230213T173000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/1
DESCRIPTION:Title: Side Channel Analysis and Lattice Attacks\nby Bill Brumley (Tampere
University) as part of Florida Atlantic University Crypto Café\n\nLectur
e held in SE43 - Room 215.\n\nAbstract\nLattice attacks are a typical endg
ame for side channel attacks targeting digital signature schemes. During t
he procurement phase\, the attacker queries digital signatures\, messages\
, and corresponding side channel traces\, then tries to extract secret inf
ormation from these traces and apply lattice methods to recover the priva
te key. But in practice\, these traces are often incomplete and/or noisy\,
complicating theoretical models for applying lattices. In this talk\, I d
iscuss some of the lattice attack techniques developed over the years\, an
d outline a few interesting open problems that highlight the gap between t
heory and practice for applied side channel attacks powered by lattice met
hods.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:David Wu (University of Texas at Austin)
DTSTART:20230327T150000Z
DTEND:20230327T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/2
DESCRIPTION:Title: Succinct Vector\, Polynomial\, and Functional Commitments from Lattices
\nby David Wu (University of Texas at Austin) as part of Florida Atlan
tic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nIn a f
unctional commitment scheme\, a user can commit to an input x and later on
\, open it to an arbitrary function evaluation f(x). We require that both
the commitment and the opening be short. Important special cases of functi
onal commitments include vector commitments and polynomial commitments. In
this talk\, I will introduce a new lattice-based framework for constructi
ng functional commitments that supports functions computable by arbitrary
(bounded-depth) Boolean circuits. Our constructions rely on a new falsifia
ble "basis-augmented SIS" assumption that we introduce\, which can be view
ed as a new "q-type" variant of the standard SIS assumption.\n\nJoint work
with Hoeteck Wee\n\nBio: David Wu is an assistant professor in the Depart
ment of Computer Science at the University of Texas at Austin. He is broad
ly interested in applied and theoretical cryptography as well as computer
security. Previously\, David received a PhD in computer science from Stanf
ord University in 2018 and was an assistant professor at the University of
Virginia from 2019 to 2021. He has received the NSF CAREER Award\, the Mi
crosoft Research Faculty Fellowship\, and a Google Research Scholar Award.
His work has been recognized with a Best Paper Award at CRYPTO (2022)\, t
wo Best Young-Researcher Paper Awards at CRYPTO (2017\, 2018) and an Outst
anding Paper Award at ESORICS (2016).\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mila Anastasova (FAU)
DTSTART:20230227T160000Z
DTEND:20230227T170000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/4
DESCRIPTION:Title: Time-Efficient Finite Field Microarchitecture Design for Curve448 and E
d448 on Cortex-M4.\nby Mila Anastasova (FAU) as part of Florida Atlant
ic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nThe ell
iptic curve family of schemes has the lowest computational latency\, memor
y use\, energy consumption\, and bandwidth requirements\, making it the mo
st preferred public key method for adoption into network protocols. Being
suitable for embedded devices and applicable for key exchange and authenti
cation\, ECC is assuming a prominent position in the field of IoT cryptogr
aphy. The attractive properties of the relatively new curve Curve448 contr
ibute to its inclusion in the TLS1.3 protocol and pique the interest of ac
ademics and engineers aiming at studying and optimizing the schemes. When
addressing low-end IoT devices\, however\, the literature indicates little
work on these curves. In this presentation\, we present an efficient desi
gn for both protocols based on Montgomery curve Curve448 and its birationa
lly equivalent Edwards curve Ed448 used for key agreement and digital sign
ature algorithm\, specifically the X448 function and the Ed448 DSA\, relyi
ng on efficient low-level arithmetic operations targeting the ARM-based Co
rtex-M4 platform. Our design performs point multiplication\, the base of t
he Elliptic Curve Diffie Hellman (ECDH)\, in 3\,2KCCs\, resulting in more
than 48% improvement compared to the best previous work based on Curve448\
, and performs sign and verify\, the main operations of the Edwards curves
Digital Signature Algorithm (EdDSA)\, in 6\,038KCCs and 7\,404KCCs\, show
ing a speedup of around 11% compared to the counterparts. We present our n
ovel modular multiplication and squaring architectures reaching ∼ 25% an
d ∼ 35% faster runtime than the previous best-reported results\, respect
ively\, based on Curve448 key exchange counterparts\, and ∼ 13% and ∼
25% better latency results than the Ed448-based digital signature counterp
arts targeting Cortex-M4 platform.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Keegan Ryan (University of California\, San Diego)
DTSTART:20230424T150000Z
DTEND:20230424T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/5
DESCRIPTION:Title: Fast Practical Lattice Reduction through Iterated Compression\nby K
eegan Ryan (University of California\, San Diego) as part of Florida Atlan
tic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nWe int
roduce a new lattice basis reduction algorithm with approximation guarante
es analogous to the LLL algorithm and practical performance that far excee
ds the current state of the art. We achieve these results by iteratively a
pplying precision management techniques within a recursive algorithm struc
ture and show the stability of this approach. We analyze the asymptotic be
havior of our algorithm\, and show that the heuristic running time is $O(n
^{\\omega}(C+n)^{1+\\varepsilon})$ for lattices of dimension $n$\, $\\omeg
a\\in (2\,3]$ bounding the cost of size reduction\, matrix multiplication\
, and QR factorization\, and $C$ bounding the log of the condition number
of the input basis $B$. This yields a running time of $O\\left(n^\\omega (
p + n)^{1 + \\varepsilon}\\right)$ for precision $p = O(\\log \\|B\\|_{max
})$ in common applications. Our algorithm is fully practical\, and we have
published our implementation. We experimentally validate our heuristic\,
give extensive benchmarks against numerous classes of cryptographic lattic
es\, and show that our algorithm significantly outperforms existing implem
entations.\n\nKeegan Ryan is a 4th year PhD student advised by Prof. Nadia
Heninger at the University of California\, San Diego. His research intere
sts include practical cryptanalysis of real-world systems\, particularly p
roblems involving lattice reduction.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Corentin Jeudy (Orange Labs\, Université de Rennes)
DTSTART:20230313T150000Z
DTEND:20230313T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/6
DESCRIPTION:Title: On the Secret Distributions in Module Learning With Errors\nby Core
ntin Jeudy (Orange Labs\, Université de Rennes) as part of Florida Atlant
ic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nThe Mod
ule Learning With Errors (M-LWE) problem is a core assumption of lattice-b
ased cryptography\, and it underlies the security of the future post-quant
um cryptography standards Kyber and Dilithium selected by NIST. The proble
m is parameterized by a secret distribution as well as an error distributi
on. There is a gap between the choices of those distributions for theoreti
cal hardness results (uniform secret modulo q) and practical schemes (smal
l bounded secret). In this talk\, we narrow this gap by presenting three r
esults focused on the secret distribution. We show that both search and de
cision M-LWE remain hard when the secret distribution is uniform over smal
l bounded secret\, provided that the rank is larger by a log(q) factor. We
then show the hardness of search M-LWE for more general secret distributi
ons carrying sufficient entropy.\n\nThis talk is based on the published pa
pers "On the Hardness of Module Learning With Errors with Short Distributi
ons" (Journal of Cryptology 2023) and "Entropic Hardness of Module-LWE fro
m Module-NTRU" (Indocrypt 2022) which are joint works with Katharina Boudg
oust\, Adeline Roux-Langlois and Weiqiang Wen.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Cariel Cohen (Securily)
DTSTART:20230410T150000Z
DTEND:20230410T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/7
DESCRIPTION:Title: Securing Cloud Business Applications: A Practical Approach to Cybersecu
rity and Compliance\nby Cariel Cohen (Securily) as part of Florida Atl
antic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nThis
topic explores practical approaches to securing business applications and
addressing cybersecurity and compliance challenges faced by businesses in
today's dynamic digital landscape. Cariel will share insights on best pra
ctices for securing cloud workloads\, data\, and applications\, including
implementing access controls\, training employees on cybersecurity awarene
ss\, and protecting data against a variety of risks. Attendees will gain v
aluable knowledge and practical solutions that are used in helping busines
ses thrive in the face of emerging cybersecurity threats and ever-changing
compliance requirements.\n\nWith over 20 years of experience in the cyber
security industry\, our speaker is a co-founder and passionate coder with
a love for cryptography\, authentication and patents. He has extensive exp
erience working with major public corporations\, including Aqua Security\,
Sony Pictures\, and 5B Technologies. Throughout his career\, he has been
dedicated to ethical hacking and compliance\, ensuring that businesses rem
ain secure and compliant in the face of emerging cybersecurity threats.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Adam Yergovich (Department of State)
DTSTART:20230829T140000Z
DTEND:20230829T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/8
DESCRIPTION:Title: Challenges in Securing a Worldwide Enterprise Network Footprint - The B
asics from Australia to Zimbabwe\nby Adam Yergovich (Department of Sta
te) as part of Florida Atlantic University Crypto Café\n\nLecture held in
SE 215.\n\nAbstract\nMany modern theories on Information Security rely on
sophisticated and efficient infrastructure we take for granted in develop
ed countries. When operating in nearly every country in the world it is n
ecessary to focus on the basics. There might be questionable infrastructu
re or even openly hostile host nations\, but basic "hygiene" is often the
best roadmap to securing information and communication - and often the mos
t neglected.\n\nSpeaker bio: Adam Yergovich works for the Department of St
ate\, Bureau of Diplomatic Security as a Regional Cyber Security Officer c
urrently stationed in Fort Lauderdale Florida. He has previously been sta
tioned in Frankfurt Germany\, Bangkok Thailand\, and Moscow Russia but tra
veled extensively within those regions. He graduated from from the Univer
sity of California Davis with a degree in Computer Science and Engineering
and worked for several years designing single board computers for a small
California company before joining State.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Zhijun Yin (FAU)
DTSTART:20230926T140000Z
DTEND:20230926T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/9
DESCRIPTION:Title: Exploring the Power of Multivariate Public Key Cryptography (MPKC)\
nby Zhijun Yin (FAU) as part of Florida Atlantic University Crypto Café\n
\nLecture held in SE 215.\n\nAbstract\nMultivariate Public Key Cryptograph
y (MPKC) leverages multivariate quadratic polynomial mappings over finite
fields as the foundation for its trapdoor one-way functions. This innovati
ve approach offers remarkable efficiency in both encryption and decryption
processes\, making it a compelling choice for secure communications.\n\nI
n contrast to traditional cryptographic methods\, attacking MPKC involves
solving a system of nonlinear equations over the finite field\, a signific
antly more complex challenge than NP-hard problems like Boolean satisfiabi
lity\, which is equivalent to solving equations over the finite field GF(2
).\n\nIn this presentation\, we will delve into MPKC through a simplified
example featuring three variables within the finite field of GF(2). This i
llustrative toy example will demystify key concepts such as public and sec
ret keys\, encryption\, decryption\, and cryptanalysis. Join us as we unra
vel the intriguing world of MPKC and its potential impact on modern crypto
graphy.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tran Ngo (FAU)
DTSTART:20231010T140000Z
DTEND:20231010T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/10
DESCRIPTION:Title: Analysis for Lattice Enumeration\nby Tran Ngo (FAU) as part of Flo
rida Atlantic University Crypto Café\n\nLecture held in SE 215.\n\nAbstra
ct\nLattice reduction algorithms such as BKZ (Block-Korkine-Zolotarev) pla
y a central role in estimating the security of lattice-based cryptography.
The subroutine in BKZ which needs to find the shortest vector in a projec
ted sublattice can be instantiated with enumeration algorithms. The enumer
ation procedure can be seen as a depth-first search on some "enumeration t
ree" whose nodes denote a partial assignment of the coefficients\, corresp
onding to lattice points as a linear combination of the lattice basis with
the coefficients. This work provides a concrete analysis for the cost of
quantum lattice enumeration based on the quantum tree backtracking algorit
hm of Montanaro (ToC\, '18). More precisely\, we give a concrete implement
ation of Montanaro's algorithm for lattice enumeration based on the quantu
m circuit model. We also show how to optimize the circuit depth by paralle
lizing the components. Based on the circuit designed\, we discuss the conc
rete quantum resource estimates required for lattice enumeration. This is
a joint work with Shi Bai\, Maya-Iggy van Hoof\, Floyd B. Johnson\, and Ta
nja Lange.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/10/
END:VEVENT
BEGIN:VEVENT
SUMMARY:William Youmans (FAU)
DTSTART:20231024T140000Z
DTEND:20231024T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/11
DESCRIPTION:Title: An algorithm for solving the principal ideal problem with subfields\nby William Youmans (FAU) as part of Florida Atlantic University Crypto
Café\n\nLecture held in SE 215.\n\nAbstract\nThe principal ideal problem
(PIP) is the problem of deciding whether a given ideal of a number field i
s principal and\, if it is\, of finding a generator. Solving the PIP appli
es to solving major computational tasks in number theory. It is also conne
cted to the search for approximate short vectors in so-called ideal lattic
es\, which is a crucial problem in cryptography. We present a novel applic
ation of norm relations to utilize information from subfields to solve the
PIP in fields of degree up to 1800.\n\nDr. William Youmans received a BA
in pure mathematics in 2017 and a PhD in mathematics in 2023 from the Univ
ersity of South Florida. Since May 2023 he has been a postdoctoral researc
h fellow at Florida Atlantic University. His research interests include la
ttice-based cryptography\, computational number theory\, and quantum algor
ithms.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Paul Zimmermann (INRIA/LORIA\, France)
DTSTART:20230912T140000Z
DTEND:20230912T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/12
DESCRIPTION:Title: Deciphering Charles Quint (A diplomatic letter from 1547)\nby Paul
Zimmermann (INRIA/LORIA\, France) as part of Florida Atlantic University
Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nAn unknown and almost
fully encrypted letter written in 1547 by Emperor Charles V to his ambass
ador at the French Court\, Jean de Saint-Mauris\, was identified in a publ
ic library\, the Bibliothèque Stanislas (Nancy\, France). As no decryptio
n of this letter was previously published or even known\, a team of crypto
graphers and historians gathered together to study the letter and its encr
yption system. First\, multiple approaches and methods were tested in orde
r to decipher the letter without any other specimen. Then\, the letter has
now been inserted within the whole correspondence between Charles and Sai
nt-Mauris\, and the key has been consolidated thanks to previous key recon
structions. Finally\, the decryption effort enabled us to uncover the cont
ent of the letter and investigate more deeply both cryptanalysis challenge
s and encryption methods.\n\nPaul Zimmermann is a Directeur de Recherche a
t INRIA/LORIA\, Nancy\, France. His research interests include asymptotica
lly fast arithmetic\, computer algebra and computational number theory. To
gether with Richard Brent\, he has written the book "Modern Computer Arith
metic"\, and he has coordinated the book "Computational Mathematics with S
ageMath". He has contributed to some of the record computations in integer
factorization and discrete logarithm. He is the author or co-author of se
veral computer packages\, including the GNU MPFR library providing arithme
tic on floating-point numbers with correct rounding\, and CADO-NFS\, an im
plementation of the number field sieve for integer factorization. His late
st project is CORE-MATH\, an implementation of mathematical functions with
correct rounding for the IEEE 754 standard formats.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/12/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Zhenisbek Assylbekov (Purdue University Fort Wayne)
DTSTART:20231107T150000Z
DTEND:20231107T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/13
DESCRIPTION:Title: Intractability of Learning AES with Gradient-based Methods\nby Zhe
nisbek Assylbekov (Purdue University Fort Wayne) as part of Florida Atlant
ic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nWe show
the approximate pairwise orthogonality of a class of functions formed by
a single AES output bit under the assumption that all of its round keys
except the initial one are independent. This result implies the hardness
of learning AES encryption (and decryption) with gradient-based methods. T
he proof relies on the Boas-Bellman type of inequality in inner-product sp
aces.\n\nBio: Zhenisbek has a PhD in Mathematical Statistics from Hiroshim
a University. After the PhD and some period of work in industry\, he got a
job at Nazarbayev University\, where he was working as a Teaching Assista
nt\, Instructor\, and Assistant Professor in the Department of Mathematics
during 2011-2023. Currently\, he is an Assistant Professor of Data Scienc
e at Purdue University Fort Wayne.\n \nHis research interests are in machi
ne learning with applications to natural language processing (NLP). He is
interested in both the theoretical analysis of machine learning algorithms
and the practical implementation and experimental evaluation of such algo
rithms on text data. He is also interested in hardness of learning which i
s closely related to cryptography because cryptographic primitives are exa
ctly what is hard for machine learning.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Paolo Santini (Università Politecnica delle Marche)
DTSTART:20231121T150000Z
DTEND:20231121T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/14
DESCRIPTION:Title: A New Formulation of the Linear Equivalence Problem and Shorter LESS S
ignatures\nby Paolo Santini (Università Politecnica delle Marche) as
part of Florida Atlantic University Crypto Café\n\nLecture held in SE 215
.\n\nAbstract\nThe problem of determining whether two linear codes are equ
ivalent is called Code Equivalence Problem. When codes are endowed with th
e Hamming metric (which is the most studied case)\, the equivalence is mai
nly considered with respect to monomial transformations (permutations with
scaling factors) and the problem is known as the Linear Equivalence Probl
em (LEP). Code equivalence can be described as a transitive\, non-commutat
ive group action and\, as such\, finds a natural application in cryptograp
hy: for example\, it is possible to design zero-knowledge proofs\, and hen
ce signature schemes. In recent works\, it has been shown that LEP can be
reformulated using notions such as information sets (arguably\, ubiquitous
objects in coding theory) and canonical forms. This unlocks some new feat
ures\, such as the possibility of communicating the equivalence map in a v
ery compact way (which leads to much shorter signatures)\, as well as open
ing new attack avenues. In this talk\, we recall the basics of code equiva
lence and then focus on these recent results\, aiming to describe how they
can be applied to boost the performance of cryptographic schemes.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/14/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Dominic Gold (FAU)
DTSTART:20231205T150000Z
DTEND:20231205T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/15
DESCRIPTION:Title: TDA-Preprocessing Yields Quantifiable Efficiency Gains in Privacy-Pres
erving ML Models\nby Dominic Gold (FAU) as part of Florida Atlantic Un
iversity Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nComputationa
l tools grounded in algebraic topology\, known collectively as topological
data analysis (TDA)\, have been used for dimensionality-reduction to pres
erve salient and discriminating features in data. TDA's flagship method\,
persistent homology (PH)\, extracts distinguishing shape characteristics f
rom the data directly and provide inherent noise-tolerance and compact\, i
nterpretable representations of high-dimensional data that are amenable to
well-established statistical methods and machine learning (ML) models\; t
his faithful but compressed representation of data motivates TDA's use to
address the complexity\, depth\, and inefficiency issues present in privac
y-preserving\, homomorphic encryption (HE)-based ML models through ciphert
ext packing---the process of packing multiple encrypted observations into
a single ciphertext for Single Instruction\, Multiple Data (SIMD) operatio
ns.\n\nBy investigating several TDA featurization techniques on the MNIST
digits dataset using a logistic regression (LR) classifier\, we demonstrat
ed that the TDA methods chosen improves encrypted model evaluation with a
10-25 fold reduction in amortized time while improving model accuracy up t
o 1.4% compared to naive reductions that used downscaling/resizing. The de
veloped technique also has implications for multiclass classification by s
ending multiple model classifications in a single packed ciphertext to red
uce the communication overhead between the Client and Server\, potentially
avoiding restriction to a binary classification (as done in past HE-ML li
terature for secure classification of MNIST digits).\n\nBiography: Dominic
Gold is a 6th year graduate teaching assistant at Florida Atlantic Univer
sity who studies both cryptography and data science\, with his main intere
st in secure/privacy-preserving machine learning on encrypted data. The in
tersectionality of his research in homomorphic encryption and topological
data analysis shows promising implications for research in both fields\, w
ith his work in cryptography recognized by venues such as USENIX and ACM C
CS. The ultimate goal of his work is to enable real-time predictions on en
crypted biomedical data to improve both the reliability\, security\, and e
quitability of healthcare systems.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/15/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Vincenzo Pallozzi Lavorante (University of South Florida)
DTSTART:20240129T150000Z
DTEND:20240129T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/16
DESCRIPTION:Title: Locality and complexity distribution in coding theory\, an approach ba
sed on Galois theory\nby Vincenzo Pallozzi Lavorante (University of So
uth Florida) as part of Florida Atlantic University Crypto Café\n\nLectur
e held in SE 215.\n\nAbstract\nThe storage of information and the necessit
y to ease the heaviness of big data computations are two key aspects to co
nsider when investigating new problems in coding theory. The concept of l
ocality is closely linked to the reliability of distributed storage system
s\, while matrix multiplication is often the first operation required for
secure distribution. This presentation will provide an overview of the lat
est developments and explore how Galois theory can offer valuable tools fo
r addressing and contributing to these areas.\n\nBio: Dr. Pallozzi Lavoran
te received a Ph.D. in Mathematics in 2022 from the University of Modena a
nd Reggio Emilia in Italy. Since August 2022 he has been a Postdoctoral fe
llow at the University of South Florida. His research interest focuses on
Galois Theory and polynomials over finite fields with applications to codi
ng theory\, code-based cryptography\, and finite geometry.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/16/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jason LeGrow (Virginia Polytechnic Institute and State University)
DTSTART:20240311T140000Z
DTEND:20240311T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/17
DESCRIPTION:Title: Post-Quantum Blind Signatures from Group Actions\nby Jason LeGrow
(Virginia Polytechnic Institute and State University) as part of Florida A
tlantic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nBl
ind signatures are a kind of cryptographic scheme which allows a User to r
eceive a Signer’s signature on a message\, in such a way that the messag
e is not revealed to the Signer. Blind signatures can be used in many appl
ications\, such as a electronic voting and anonymous purchasing. To resist
attacks by quantum computers\, we must design blind signature schemes bas
ed on computational problems which are believed to be hard for quantum com
puters: so-called post-quantum protocols. I will discuss techniques for co
nstructing post-quantum blind signatures from cryptographic group actions
in the setting of isogeny-based cryptography and code-based cryptography.\
n
LOCATION:https://researchseminars.org/talk/CryptoCafe/17/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Xinxin Fan (IoTeX)
DTSTART:20240325T140000Z
DTEND:20240325T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/18
DESCRIPTION:Title: Zero-Knowledge Proofs - An Industry Perspective\nby Xinxin Fan (Io
TeX) as part of Florida Atlantic University Crypto Café\n\nLecture held i
n SE 215.\n\nAbstract\nDriven by the rapid growth of blockchain and web3\,
zero-knowledge proofs have gained considerable development during the pas
t few years. In this talk\, I will give a state-of-the-art overview of zer
o-knowledge proofs and their potential use cases from an industry perspect
ive and highlight a number of research challenges that need to be further
investigated.\n\nDr. Xinxin Fan is the Head of Cryptography at IoTeX\, a S
ilicon Valley-based technology platform that empowers the emerging machine
economy with innovative combination of blockchain and IoT. He is responsi
ble for directing the company’s strategy and product roadmaps as well as
developing the core technologies and IP portfolio. Before joining IoTeX\,
he was a senior research engineer of the Security and Privacy Group at Bo
sch Research Technology Center North America. Dr. Xinxin Fan received his
Ph.D. in Electrical and Computer Engineering from the University of Waterl
oo in 2010. He has published 60+ referred research papers in top-tier jour
nals\, conferences and workshops in the areas of cryptography and informat
ion security and is an inventor of 17 patent filings for innovative inform
ation security and privacy-enhancing technologies. He is also a Certified
Information Systems Security Professional (CISSP) from (ISC)^2 and a (co-)
chair of IEEE P2418.1 and IEEE P2958 standards working groups.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/18/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Francesco Sica (FAU)
DTSTART:20240408T140000Z
DTEND:20240408T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/19
DESCRIPTION:Title: Acceleration of multiscalar multiplication for zkSNARKs\nby France
sco Sica (FAU) as part of Florida Atlantic University Crypto Café\n\nLect
ure held in SE 215.\n\nAbstract\nThe main computational bottleneck in the
implementation of zero-knowledge succinct arguments of knowledge (zkSNARKs
) based on elliptic curves\, such as Pinocchio\, is the evaluation (called
multiscalar multiplication) $\\sum_{i=1}^n a_i P_i$\, where the $a_i$’s
are scalar and the $P_i$’s are fixed elliptic curve points. We will rev
iew currently used techniques and introduce new improvements. \nThis is jo
int work with Xinxin Fan\, Veronika Kuchta and Lei Xu.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Merve Karabulut (FAU)
DTSTART:20240212T150000Z
DTEND:20240212T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/20
DESCRIPTION:Title: Number Theoretic Transform: A Python-based Speed Enhancement\nby M
erve Karabulut (FAU) as part of Florida Atlantic University Crypto Café\n
\nLecture held in SE 215.\n\nAbstract\nOur proposal involves a Python-base
d solution that utilizes Numba's just-in-time compilation capabilities. We
aim to optimize the control flow of the Number Theoretic Transform (NTT)
operation to exploit parallelism in modern CPUs. Our solution leverages mu
lti-core processing\, multi-threading\, and cache memory.\n\nSpeaker bio:
Merve is a computer engineering graduate from Yildiz Technical University\
, with experience in full-stack development and blockchain\, especially wi
th Hyperledger. At FAU\, she is working towards a Ph.D.\, focusing on PQC
with Dr. Reza Azarderakhsh. Her goal is to create secure solutions resista
nt to quantum computing and efficient implementation of algorithms.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/20/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lukas Kölsch (University of South Florida)
DTSTART:20240226T213000Z
DTEND:20240226T223000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/21
DESCRIPTION:Title: A general and unifying construction for semifields and their related m
aximum rank distance codes\nby Lukas Kölsch (University of South Flor
ida) as part of Florida Atlantic University Crypto Café\n\n\nAbstract\n**
******* IMPORTANT: THIS TALK AT 4:30 PM *********\n\nSemifields are algebr
aic structures that can be for instance used to construct nondesarguesian
planes in finite geometry\, as well as maximum rank distance (MRD) codes w
ith special parameters (more precisely\, every element in the code will be
a square matrix with full rank). Many constructions of MRD codes are root
ed in ideas from semifield theory. Interestingly\, many known construction
s of semifields only exist in even dimension (i.e. the dimension over the
prime field is even)\, leading to MRD codes in even dimension or MRD codes
in odd dimension over a field of even degree. In this talk\, we present a
unifying construction for almost all semifields of this type\, including
semifields found by Dickson\, Knuth\, Hughes-Kleinfeld\, Taniguchi\, Dempw
olff\, Bierbrauer\, Zhou-Pott in the last 120 years. Our construction reco
vers all these semifields\, and gives many new examples.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/21/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Edoardo Persichetti (FAU)
DTSTART:20240905T140000Z
DTEND:20240905T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/22
DESCRIPTION:Title: A Brief Introduction to Code-Based Cryptography\nby Edoardo Persic
hetti (FAU) as part of Florida Atlantic University Crypto Café\n\nLecture
held in SE 215.\n\nAbstract\nCode-based cryptographic primitives are amon
g 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 histor
y of this field\, highlighting the main constructions\, modern approaches\
, and recent developments. Everyone welcome!\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/22/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shi Bai (FAU)
DTSTART:20240919T140000Z
DTEND:20240919T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/23
DESCRIPTION:Title: Lattice-based cryptography: construction and analysis.\nby Shi Bai
(FAU) as part of Florida Atlantic University Crypto Café\n\nLecture held
in SE 215.\n\nAbstract\nLattice-based cryptography holds a great promise
for post-quantum cryptography. It enjoys strong security proof based on th
e so-called worst-case to average-case reduction\; relatively\nefficient i
mplementations\; as well as algorithmic simplicity. In this talk\, we will
discuss a post-quantum scheme based on lattice\; and several algorithms f
or evaluating the security of average-case/worst-case problems in lattice-
based cryptography.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/23/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ruslan Ospanov (Eurasian National University)
DTSTART:20241017T140000Z
DTEND:20241017T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/24
DESCRIPTION:Title: The MCDM-RL-based Framework for Consensus Protocol Selection for IoT n
etworks.\nby Ruslan Ospanov (Eurasian National University) as part of
Florida Atlantic University Crypto Café\n\nLecture held in SE 215.\n\nAbs
tract\nThis topic is a part of my PhD research topic: “Design and analys
is of cryptographic algorithms and protocols for solving the problem of co
nsensus in distributed ledger technologies”. \n\nReinforcement learning
(RL) has played a key role in the rapid development of artificial intellig
ence technologies that has been observed over the past decade. Reinforceme
nt learning methods have shown impressive results in a range of fields. Sp
ecifically\, RL is widely applied in robotics\, control systems\, and the
Internet of Things (IoT) to address challenges in automation\, optimizatio
n\, and the management of complex systems. The IoT is also a major area fo
r the implementation of distributed ledger and blockchain technologies\, w
hich provide effective solutions to overcome the limitations of convention
al IoT applications. A key element of the distributed ledger reference arc
hitecture is the consensus layer\, which handles agreement among network n
odes\, ensuring the ledger’s state remains consistent while maintaining
data security\, accuracy\, and protection. The selection of a consensus pr
otocol plays a crucial role in determining the performance and security of
the blockchain system. \n\nThis talk is devoted to the issue of selection
a blockchain consensus protocol for IoT networks using the combined appli
cation 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 pr
otocol selection and management system for IoT networks based on the multi
-criteria decision making method and reinforcement learning.\n\nRuslan Osp
anov has been engaged in scientific and educational activities in the fiel
d of mathematics and cryptography for more than 20 years\, has dozens of s
cientific and scientific-methodological works\, as well as several copyrig
ht certificates from Qazpatent (National Institute of Intellectual Propert
y of the Ministry of Justice of the Republic of Kazakhstan (NIIP)). He wor
ked as a teacher in various universities of Kazakhstan (Karaganda State Un
iversity named after academician E.A. Buketov\, L.N. Gumilyov Eurasian Nat
ional 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 studen
t at the Eurasian National University named after L.N. Gumilyov\, speciali
zing in Information Security Systems.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/24/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Veronika Kuchta (FAU)
DTSTART:20241003T140000Z
DTEND:20241003T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/25
DESCRIPTION:Title: Proximity gaps for Reed-Solomon Codes and their Application in Interac
tive Oracle Proofs of Proximity and ZK-SNARKs\nby Veronika Kuchta (FAU
) as part of Florida Atlantic University Crypto Café\n\nLecture held in S
E 215.\n\nAbstract\nReed-Solomon codes have long been a fundamental tool o
f error correction and data integrity\, but their applications extend far
beyond traditional coding theory. In this talk\, I will explore the concep
t of proximity gaps within Reed-Solomon codes—specific measures of how
far a received word is from the closest codeword—and their critical rol
e 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).\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/25/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Francesco Sica (FAU)
DTSTART:20241031T140000Z
DTEND:20241031T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/26
DESCRIPTION:Title: Group Actions and the Discrete Log Problem\nby Francesco Sica (FAU
) as part of Florida Atlantic University Crypto Café\n\nLecture held in S
E 215.\n\nAbstract\nThe 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 proble
m (VP)\, asking to recover $\\gamma\\in G$ from knowledge of $x\\in X$ and
$y=\\gamma \\cdot x$.\n\nWe will discuss generic algorithms to solve the
VP\, in particular in the presence of hints $z=\\gamma^d \\cdot x$\, rephr
asing a 2006 argument of Cheon.\n\nFrancesco Sica is an assistant professo
r in the FAU department of mathematics and statistics. His research lies a
t the intersection of number theory and cryptography\, trying to discover
beautiful connections between the two.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/26/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Merey Sarsengeldin (University of Central Florida)
DTSTART:20241114T150000Z
DTEND:20241114T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/27
DESCRIPTION:Title: Variational Quantum Neural Network for modeling and solving Heat and M
ass transfer problems.\nby Merey Sarsengeldin (University of Central F
lorida) as part of Florida Atlantic University Crypto Café\n\nLecture hel
d in SE 215.\n\nAbstract\nIn this study we present a hybrid\nquantum-class
ical neural network (Variational Quantum\nAlgorithm) to model and solve he
at and mass transfer\nproblems. The underlying PDEs responsible for modeli
ng diverse phenomena are Stefan Type Problems. These problems are nonlinea
r where along with the unknown temperature function unknown boundary or fl
ux function has to be determined. This kind of Free Boundary Value Problem
s are hard to solve analytically. To solve such kind problems analytically
and numerically\, we benefit from computational power of Quantum Computin
g and utilize neural networks as a universal function approximator to find
the Heat function and Moving Phase boundary. On the basis of the Variatio
nal Quantum Neural Network\, we have developed methodological framework an
d\nsoftware artifact which might be of interest and beneficial for researc
hers and engineers working in the field of modeling Heat and Mass transfer
phenomena.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/27/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Abhraneel Dutta (FAU)
DTSTART:20241205T150000Z
DTEND:20241205T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/29
DESCRIPTION:Title: Polynomial Inversion Algorithms in Constant Time for Post-Quantum Cryp
tography\nby Abhraneel Dutta (FAU) as part of Florida Atlantic Univers
ity Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nThe computation o
f 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 cryptosys
tems like NTRU\, BIKE\, and LEDACrypt. It is therefore important that ther
e exist an efficient algorithm capable of running in constant time\, to pr
event timing side-channel attacks. In this article\, we study both constan
t-time algorithms based on Fermat's Little Theorem and the Extended GCD Al
gorithm\, and provide a detailed comparison in terms of performance. Accor
ding 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 fr
om a software implementation\, we additionally provide a short glimpse of
some recent results when these two algorithms are implemented on various h
ardware platforms. Finally\, we also explore other exponentiation algorith
ms that work similarly to the Itoh-Tsuji inversion method. These algorithm
s perform fewer polynomial multiplications and show a better performance w
ith 1.56x-1.96x on x86 platform compared to Itoh-Tsuji inversion method.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/29/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Edoardo Persichetti (FAU)
DTSTART:20250116T150000Z
DTEND:20250116T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/30
DESCRIPTION:Title: On Digital Signatures from Cryptographic Group Actions\nby Edoardo
Persichetti (FAU) as part of Florida Atlantic University Crypto Café\n\n
Lecture held in SE 215.\n\nAbstract\nCryptography based on group actions h
as 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. I
n this talk\, we present our work on a unified taxonomy of a variety of te
chniques used to design digital signature schemes. We describe all techniq
ues in a single fashion\, show how they impact the performance of the resu
lting protocols and analyse how different techniques can be combined for o
ptimal performance. Everyone welcome!\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/30/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Eliana Carozza (IRIF\, France)
DTSTART:20250130T150000Z
DTEND:20250130T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/31
DESCRIPTION:Title: Faster Signatures from MPC-in-the-Head\nby Eliana Carozza (IRIF\,
France) as part of Florida Atlantic University Crypto Café\n\nLecture hel
d in SE 215.\n\nAbstract\nThe construction of signature schemes using the
MPC-in-the-head paradigm is revisited\, leading to two main contributions:
\n\n– It is observed that prior signatures within the MPC-in-the-head pa
radigm require a salted version of the GGM puncturable pseudorandom functi
on (PPRF) to mitigate collision attacks. A new efficient PPRF construction
is presented\, which is provably secure in the multi-instance setting. Th
e security analysis\, conducted in the ideal cipher model\, represents a c
ore technical contribution. Unlike previous constructions that relied on h
ash functions\, the proposed PPRF uses only a fixed-key block cipher\, res
ulting in significant efficiency gains\, with speed improvements ranging f
rom 12× to 55× for a recent signature scheme (Joux and Huth\, Crypto’2
4). This improved PPRF has the potential to enhance the performance of var
ious MPC-in-the-head signatures.\n\n– A new signature scheme is introduc
ed\, based on the regular syndrome decoding assumption and a novel protoco
l for the MPC-in-the-head paradigm. The proposed scheme achieves a substan
tial reduction in communication overhead compared to earlier works. Despit
e its conceptual simplicity\, the security analysis involves intricate com
binatorial considerations.\n\nEliana Carozza is a PhD researcher at IRIF\,
Université Paris Cité\, specializing in post-quantum cryptography and a
dvanced code-based cryptographic primitives.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/31/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ivana Trummová (Czech Technical University)
DTSTART:20250213T150000Z
DTEND:20250213T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/32
DESCRIPTION:Title: Human Factors in Cryptography\nby Ivana Trummová (Czech Technical
University) as part of Florida Atlantic University Crypto Café\n\nLectur
e held in SE 215.\n\nAbstract\nCryptography can be considered a part of ma
thematics 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 mistake
s. 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 c
ryptography ecosystem\, described the systemic barriers that hinder crypto
graphy 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 competit
ions and their impacts on cryptographic community.\n\nAbout the speaker: I
vana Trummová is a cryptography researcher and a teacher focusing on huma
n factors in security and inter-disciplinary research. She is currently pu
rsuing a PhD in Cryptography at the Faculty of Information Technology\, Cz
ech Technical University (CTU) in Prague\, Czech Republic. She also works
as a teacher assistant at CTU\, teaching courses on cryptography\, mathema
tics and cybersecurity\, and recently also a new course called "Human Fact
ors in Cryptography and Security"\, which aims to bring an inter-disciplin
ary point of view to computer science students.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/32/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Dominic Gold (Johns Hopkins University Applied Physics Laboratory)
DTSTART:20250227T150000Z
DTEND:20250227T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/33
DESCRIPTION:Title: Deterministic Random Bit Generators in Cryptography\nby Dominic Go
ld (Johns Hopkins University Applied Physics Laboratory) as part of Florid
a Atlantic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\
nMany cryptographic protocols (e.g.\, key generation\, nonces\, secret sha
ring) require “good random” as a raw material\, which may be extracted
from noise sources surrounding the consuming application. However\, if th
e noise sources are biased\, inefficiently generated\, or contain low leve
ls of entropy\, then a deterministic random bit generator (DRBG)—also kn
own as a pseudorandom random number generator (PRNG)—may be used. These
DRBGs ingest the aforementioned noise sources\, create random seeds\, and
generate random values for further use in downstream cryptographic applica
tions\, and thus function identically to a true random number generator (T
RNG) so long as the noise source itself is not modellable. We will discuss
this pipeline of random number generation\, and go over some of the secur
ity guarantees within a DRBG.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/33/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Merve Karabulut (FAU)
DTSTART:20250327T140000Z
DTEND:20250327T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/34
DESCRIPTION:Title: Efficient CPA Attack on Hardware Implementation of ML-DSA in Post-Quan
tum Root of Trust\nby Merve Karabulut (FAU) as part of Florida Atlanti
c University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nSide-cha
nnel attacks (SCA) present a serious threat to cryptographic implementatio
ns\, including those designed for post-quantum security. This talk introdu
ces the first Correlation Power Analysis (CPA) attack on an industry-grade
hardware implementation of ML-DSA within a Silicon Root of Trust framewor
k. Our attack exploits side-channel leakage from the modular reduction pro
cess following the Number Theoretic Transform-based polynomial multiplicat
ion. By leveraging leakage from a unique reduction algorithm and the zeroi
zation mechanism used for securely erasing sensitive data\, we demonstrate
secret key extraction using only 10\,000 power traces. This attack compro
mises 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 th
e need for robust countermeasures.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/34/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Maryam Taghi Zadeh (FAU)
DTSTART:20250410T140000Z
DTEND:20250410T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/35
DESCRIPTION:Title: Post-Quantum Hash-Based Digital Signature Scheme: XMSS with SHA-2 and
SHA-3 Hash Functions\nby Maryam Taghi Zadeh (FAU) as part of Florida A
tlantic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nTh
is talk presents a comprehensive investigation of the eXtended Merkle Sign
ature Scheme (XMSS) implemented with both SHA-2 and SHA-3 hash function fa
milies as specified in FIPS 202 and RFC 8391. XMSS is a stateful hash-base
d digital signature scheme that provides post-quantum security guarantees\
, making it a critical consideration amid growing quantum computing threat
s to conventional public-key cryptography.\n\nThe SHA-2 and SHA-3 hash fun
ction families exhibit distinct security characteristics when integrated i
nto XMSS implementations. This research evaluates their comparative perfor
mance metrics\, security properties\, and implementation considerations wi
thin the XMSS framework. We analyze the practical implications of various
parameter sets as defined in RFC 8391\, specifically examining tree height
and Winternitz parameter selections and their effects on signature size\,
generation time\, and verification efficiency.\n\nOur work demonstrates t
he viability of both hash function families within XMSS while highlighting
their specific trade-offs. The SHA-3 implementation\, based on the Keccak
algorithm standardized in FIPS 202\, provides superior resistance against
side-channel attacks and length extension vulnerabilities compared to SHA
-2\, while exhibiting different performance characteristics. We present em
pirical data on computational efficiency across multiple platforms and add
ress the state management challenges inherent to stateful signature scheme
s like XMSS.\n\nThis research contributes to ongoing standardization effor
ts for post-quantum cryptographic primitives and provides practical insigh
ts for organizations preparing for the transition to quantum-resistant sig
nature schemes.\n\nKeywords: Post-Quantum Cryptography\, Hash-Based Signat
ures\, XMSS\, SHA-2\, SHA-3\, Digital Signatures\, Cryptographic Implement
ation\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/35/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Dipayan Das (FAU)
DTSTART:20250313T140000Z
DTEND:20250313T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/38
DESCRIPTION:Title: Cryptanalysis of some Lattice-based Assumptions\nby Dipayan Das (F
AU) as part of Florida Atlantic University Crypto Café\n\nLecture held in
SE 215.\n\nAbstract\nCryptography relies on the assumptions of computatio
nally hard\nproblems. It should be hard for security\, offer\nfunctionalit
ies for cryptographic applications\, and be efficient to\nimplement. Recen
tly\, lattice-based assumptions have emerged as a strong\nbuilding block f
or post-quantum cryptography. In this talk\, I will\npresent recent crypta
nalytic results on two lattice-based assumptions\,\nnamely the Finite Fiel
d Isomorphism problem (PKC'18\, JoMC'20)\, and the\nPartial Vandermonde K
napsack Problem (ACNS'14\, DCC'15\, ACISP'18\, Eprint'20\,DCC'22).\nThese
assumptions have been used extensively for\nvarious lattice-based constru
ctions\, including encryptions\, fully\nhomomorphic encryptions\, signatur
es\, signature aggregations\, etc.\n\nAbout the speaker: Dipayan Das is an
Assistant Professor in the Florida Atlantic University Department of Math
ematics and Statistics. Previously\, he was a Postdoc researcher at the NT
T 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 Indi
a.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/38/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hansraj Jangir (Florida Atlantic University)
DTSTART:20250902T140000Z
DTEND:20250902T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/40
DESCRIPTION:Title: A Quasi-polynomial time Quantum Algorithm for the Extrapolated Dihedra
l Coset Problem\nby Hansraj Jangir (Florida Atlantic University) as pa
rt of Florida Atlantic University Crypto Café\n\nLecture held in SE 215.\
n\nAbstract\nThe Learning With Errors (LWE) problem\, introduced by Regev
(STOC’05)\, is one of the fundamental problems in lattice-based cryptogr
aphy\, believed to be hard even for quantum adversaries. Regev (FOCS’02)
showed that LWE reduces to the quantum Dihedral Coset Problem (DCP) and l
ater\, Brakerski et al. (PKC 2018) extended this to the more general Extra
polated Dihedral Coset Problem (EDCP). In this talk\, we present a quasi-p
olynomial time quantum algorithm for solving EDCP over power-of-two moduli
\, using a quasi-polynomial number of samples. We stress that our algorith
m does not affect the security of LWE with standard parameters\, as the re
duction from standard LWE to EDCP limits the number of samples to be polyn
omial.\n\nHansraj is a PhD student in the Department of Mathematics and St
atistics at Florida Atlantic University\, Boca Raton. Prior to starting hi
s doctoral studies\, he worked as a Junior Research Fellow at the Defense
Research and Development Organization (DRDO)\, Delhi. His research interes
ts include lattice based cryptography and quantum algorithms.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/40/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Dung Bui (Sorbonne Université)
DTSTART:20250916T140000Z
DTEND:20250916T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/41
DESCRIPTION:Title: FOLEAGE: F4OLE-Based Multi-Party Computation for Boolean Circuits\
nby Dung Bui (Sorbonne Université) as part of Florida Atlantic University
Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nSecure Multi-party C
omputation (MPC) allows two or more parties to compute any public function
over their privately-held inputs\, without revealing any information beyo
nd the result of the computation. Modern protocols for MPC generate a larg
e amount of input-independent preprocessing material called multiplication
triples\, in an offline phase. This preprocessing can later be used by th
e parties to efficiently instantiate an input-dependent online phase compu
ting the function.\n \nTo date\, the state-of-the-art secure multi-party c
omputation protocols in the preprocessing model are tailored to secure com
putation of arithmetic circuits over large fields and require little commu
nication in the preprocessing phase\, typically $O(N · m)$ to generate m
triples among $N$ parties. In contrast\, when it comes to computing prepro
cessing for computations that are naturally represented as Boolean circuit
s\, the state-of-the-art techniques have not evolved since the 1980s\, and
in particular\, require every pair of parties to execute a large number o
f oblivious transfers before interacting to convert them to $N$-party trip
les\, which induces an $\\Omega(N^2 \\cdot m)$ communication overhead.\n \
nIn this paper\, we introduce FOLEAGE\, which addresses this gap by introd
ucing an efficient preprocessing protocol tailored to Boolean circuits. FO
LEAGE exhibits excellent performance: It generates $m$ multiplication trip
les over $\\mathbb F_2$ using only $N \\cdot m + O(N^2 \\cdot \\log m)$ bi
ts of communication for $N$-parties\, and can concretely produce over 12 m
illion triples per second in the 2-party setting on one core of a commodit
y machine. Our result builds upon an efficient Pseudorandom Correlation Ge
nerator (PCG) for multiplication triples over the field $\\mathbb F_4$. Ro
ughly speaking\, a PCG enables parties to stretch a short seed into a larg
e number of pseudorandom correlations non-interactively\, which greatly im
proves the efficiency of the offline phase in MPC protocols. Our construct
ion significantly outperforms the state-of-the-art\, which we demonstrate
via a prototype implementation. This is achieved by introducing a number o
f protocol-level\, algorithmic-level\, and implementation-level optimizati
ons on the recent PCG construction of Bombar et al. (Crypto 2023) from the
Quasi-Abelian Syndrome Decoding assumption.\n\nBio: Dung Bui is a postdoc
toral researcher at LIP6\, Sorbonne Université\, France. She completed he
r PhD at IRIF\, Université Paris Cité.\nHer research interests are in va
rious aspects of both practical and theoretical cryptography\, including s
ecure multiparty computation\, zero-knowledge proofs\, and post-quantum cr
yptography.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/41/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sohyun Jeon (Ewha Womans University)
DTSTART:20251028T140000Z
DTEND:20251028T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/42
DESCRIPTION:Title: LastRings: Lattice-based Scalable Threshold Ring Signatures\nby So
hyun Jeon (Ewha Womans University) as part of Florida Atlantic University
Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nThis talk presents th
e first lattice-based threshold ring signature scheme with signature size
scaling logarithmically in the size of the ring while supporting arbitrary
thresholds. Our construction is also concretely efficient\, achieving sig
nature sizes of less than 150kB for ring sizes up to N=4096 (with threshol
d size T=N/2\, say). This is substantially more compact than previous work
.\nOur approach is inspired by the recent work of Aardal et al. (CRYPTO 20
24) on the compact aggregation of Falcon signatures\, that uses the LaBRAD
OR lattice-based SNARKs to combine a collection of Falcon signatures into
a single succinct argument of knowledge of those signatures. We proceed in
a similar way to obtain compact threshold ring signatures from Falcon\, b
ut crucially require that the proof system be zero-knowledge in order to e
nsure the privacy of signers. Since LaBRADOR is not a zkSNARK\, we associa
te it with a separate (non-succinct) lattice-based zero-knowledge proof sy
stem to achieve our desired properties.\n\nBio: Sohyun Jeon recently compl
eted a PhD at Ewha Womans University in the Republic of Korea. Research in
terests are lattice-based cryptography. In particular\, she is interested
in zero-knowledge proofs and their applications.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/42/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Anil Kumar Pradhan (Vaultree)
DTSTART:20251014T140000Z
DTEND:20251014T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/43
DESCRIPTION:Title: Beyond Theory: Industry Challenges in Adopting Homomorphic Encryption<
/a>\nby Anil Kumar Pradhan (Vaultree) as part of Florida Atlantic Universi
ty Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nFully Homomorphic
Encryption (FHE) promises quantum-resilient\, privacy-preserving computati
on for sensitive data across industries. However\, despite academic breakt
hroughs\, the leap from laboratory models to enterprise-scale adoption rem
ains daunting. Industry faces formidable obstacles\, including computation
al resource demands\, implementation complexity\, slow processing speeds\,
and high costs\, aggravated by a shortage of FHE talent and lack of stand
ardized practices. Integrating FHE into legacy and cloud systems requires
extensive technical overhaul\, often with questionable ROI. The disconnect
between academic solutions and practical business needs\, especially rega
rding scalability\, cost\, and integration continues to deter widespread i
mplementation. Emerging technologies and optimization strategies\, such as
hardware acceleration and real-world application benchmarking\, may help
bridge the gap\, but genuine adoption will require collaborative efforts a
nd a shift in focus from theoretical promise to operational feasibility.\n
\nAnil Kumar Pradhan is a cryptographer specializing in practical privacy-
enhancing technologies and their deployment in real-world systems. At Vaul
tree\, he works at the intersection of advanced cryptography and industry
adoption\, focusing on fully homomorphic encryption (FHE)\, encrypted mach
ine learning\, and secure computation at scale. With a background spanning
both academic research and enterprise engineering\, he bridges the gap be
tween theoretical innovation and operational feasibility. Anil has contrib
uted to projects that bring cutting-edge cryptographic methods into produc
tion environments\, with particular attention to performance optimization\
, compliance\, and developer experience. He is passionate about making str
ong cryptography usable\, scalable\, and impactful across industries that
handle sensitive data.\n\nAnil Kumar Pradhan is the Founding Cryptographer
and Cryptography Research Lead at Vaultree Ireland\, and has over a decad
e of experience in applied cryptography. He holds an M.Sc. in Mathematics
from the Indian Institute of Technology\, Delhi\, and a B.Sc. (Hons) in Ma
thematics and Computing from the Institute of Mathematics and Applications
\, Bhubaneswar.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/43/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Arindam Mukherjee (A.M. College\, Jhalda)
DTSTART:20251125T150000Z
DTEND:20251125T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/44
DESCRIPTION:Title: The Representation Technique for Small Max-Norm LWE\nby Arindam Mu
kherjee (A.M. College\, Jhalda) as part of Florida Atlantic University Cry
pto Café\n\nLecture held in SE 215.\n\nAbstract\nThe Representation Techn
ique\, originally introduced by Howgrave-Graham and Joux in the context of
the Subset Sum problem\, has since become a powerful tool in algorithmic
cryptanalysis. It was later adapted for Information Set Decoding (ISD). Cu
rrently\, the state-of-the-art algorithms to counter subset sum and syndro
me decoding problems make use of the representation technique in some form
. Recently\, May (Crypto 2021) proposed a representation-based attack agai
nst small max-norm LWE. This work was later improved in Asiacrypt 2023 and
JoC 2024 (https://eprint.iacr.org/2023/243).\nIn this talk\, we will give
an overview of the representation technique and its impact on the small m
ax-norm LWE problem.\n\nArindam Mukherjee works in public-key cryptanalysi
s\, with a focus on post-quantum hardness assumptions. He received his MSc
and PhD in Mathematics from IIT Madras\, Chennai\, India. He is currently
an Assistant Professor in Mathematics at A.M. College\, Jhalda\, India.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/44/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Anil Kumar Pradhan
DTSTART:20250930T140000Z
DTEND:20250930T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/45
DESCRIPTION:Title: Talk postponed to October 14\nby Anil Kumar Pradhan as part of Flo
rida Atlantic University Crypto Café\n\nLecture held in SE 215.\nAbstract
: TBA\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/45/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Bardia Taghavi (FAU)
DTSTART:20260203T150000Z
DTEND:20260203T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/46
DESCRIPTION:Title: Two Birds\, One Stone: A Unified High-Performance NTT Architecture for
ML-KEM and ML-DSA\nby Bardia Taghavi (FAU) as part of Florida Atlanti
c University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nWith the
recent NIST standardization of ML-KEM (Kyber) and ML-DSA (Dilithium)\, th
e focus of Post-Quantum Cryptography (PQC) research has shifted from algor
ithm selection to efficient hardware implementation. While both schemes re
ly on the hardness of the module-lattice hardness assumptions and utilize
the Number Theoretic Transform (NTT) for fast polynomial multiplication\,
they operate over distinct algebraic rings ($R_q$ with $q=3329$ for Kyber
vs. $q=8\,380\,417$ for Dilithium). This discrepancy typically forces hard
ware designers to implement separate\, redundant accelerators for each sch
eme\, leading to suboptimal area efficiency.\nIn this talk\, I will presen
t a novel\, high-performance unified NTT architecture capable of accelerat
ing both ML-KEM and ML-DSA within a single\, reconfigurable hardware block
. We will examine the mathematical structures that allow for a "dual-mode"
Butterfly Unit (BFU) design\, utilizing configurable modular reduction te
chniques (such as Barrett reduction or Montgomery multiplication) that ada
pt to either modulus at runtime.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/46/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Luke Carey (FAU)
DTSTART:20260217T150000Z
DTEND:20260217T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/47
DESCRIPTION:Title: An Overview of DualMS: A Post-Quantum Multi-Signature\nby Luke Car
ey (FAU) as part of Florida Atlantic University Crypto Café\n\nLecture he
ld in SE 215.\n\nAbstract\nA multi-signature is a cryptographic scheme whi
ch allows for multiple independent parties to sign a singular message toge
ther. The scheme DualMS by Yanbo Chen (2023) is an example of a post-quant
um lattice-based two-round multi-signature scheme\, which utilizes many fa
scinating cryptographic techniques\, including Module Learning with Errors
(MLWE)\, rejection sampling\, and the discrete Gaussian. At this talk\, w
e will give an overview of DualMS\, give a very short outline of the proof
of security\, and briefly discuss possible future directions we can take
DualMS.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/47/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Merve Karabulut (FAU)
DTSTART:20260303T150000Z
DTEND:20260303T160000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/48
DESCRIPTION:Title: Area–Efficient First-Order Masked Modular Reduction for ML-DSA in Ca
liptra Root-of-Trust\nby Merve Karabulut (FAU) as part of Florida Atla
ntic University Crypto Café\n\nLecture held in SE 271.\n\nAbstract\nMaski
ng is an effective countermeasure against side-channel attacks\, yet it of
ten introduces significant hardware overhead. In the Caliptra Root-of-Trus
t\, the masked ML-DSA implementation incurs approximately 6× area overhea
d due to modular reduction costs. In this talk\, I will present a novel fi
rst-order masking architecture that significantly optimizes the modular re
duction stage of ML-DSA. Compared to Caliptra’s baseline design\, our im
plementation achieves a 12.1× speedup\, reduces LUT usage by 86.7% and fl
ip-flops by 94.5%\, and improves area–delay efficiency by 91×. Extensiv
e TVLA evaluation with over 1\,000\,000 traces shows no detectable first-o
rder leakage\, meeting Caliptra’s security requirements while substantia
lly improving implementation efficiency.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/48/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Maryam Taghi Zadeh (FAU)
DTSTART:20260317T140000Z
DTEND:20260317T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/49
DESCRIPTION:Title: Hardware-Software Co-Design of XMSS Post-Quantum Digital Signature on
FPGA\nby Maryam Taghi Zadeh (FAU) as part of Florida Atlantic Universi
ty Crypto Café\n\nLecture held in SE 271.\n\nAbstract\nWith the growing d
emand for quantum-resistant cryptographic solutions\, hash-based signature
schemes such as XMSS (eXtended Merkle Signature Scheme) have emerged as s
trong candidates for post-quantum security. In this work\, we present a ha
rdware-software co-design implementation of XMSS on the PYNQ-Z2 FPGA platf
orm\, where the computationally intensive SHAKE-256 hash core is offloaded
to the programmable logic fabric while the higher-level signature control
flow is managed by the ARM processor. The hardware accelerator is integra
ted with the software layer through an AXI interface\, enabling efficient
data transfer and synchronization. We explore multiple architectural optim
izations including multi-round-per-cycle configurations\, achieving notabl
e improvements in clock frequency alongside reductions in overall signing
latency and improved resource utilization. The results demonstrate that FP
GA-based co-design is a practical and efficient approach for deploying pos
t-quantum cryptography in embedded and IoT environments.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/49/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Christophe Petit (ULB\, Belgium)
DTSTART:20260414T140000Z
DTEND:20260414T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/50
DESCRIPTION:Title: Quantum Security of the Vectorization Problem with Shifted Inputs\
nby Christophe Petit (ULB\, Belgium) as part of Florida Atlantic Universit
y Crypto Café\n\nLecture held in SE 271.\n\nAbstract\nCryptographic group
actions provide a basis for simple post-quantum generalizations of many c
ryptographic protocols based on the discrete logarithm problem (DLP). Howe
ver\, many advanced group action-based protocols do not solely rely on the
core group action problem (the so-called vectorization problem)\, but als
o on variants of this problem\, to either improve efficiency or enable new
functionalities. In particular\, the security of the CSI-SharK threshold
signature protocol relies on the hardness of the Vectorization Problem wit
h Shifted Inputs where (in DLP formalism) the adversary not only receives
$g$ and $g^x$\, but also $g^{xc}$ for multiple known values of $c$.\nA na
tural open question is whether the extra data provided to the adversary in
this variant allows them to solve the underlying problem more efficiently
. In this paper\, we revisit the concrete quantum security of this problem
. We start from a quantum multiple hidden shift algorithm of Childs and va
n Dam\, which to the best of our knowledge was never applied in cryptograp
hy before. We specify algorithms for its subroutines and we provide concre
te complexity estimates for both these subroutines and the overall algorit
hm. We apply our analysis to the CSI-SharK protocol. In prior analyses bas
ed on Kuperberg’s algorithms\, group action evaluations contributed to a
significant part of the overall T-gate cost. For CSI-SharK suggested para
meters\, our new approach requires significantly fewer calls to the group
action evaluation subroutine\, leading to significant complexity improveme
nts overall. We describe two instances of our approach\, one which lowers
the T-gate complexity\, and the other the QRAM requirements. We obtain sig
nificant speedups – even in both metrics simultaneously – and we quant
ify the degradation of the quantum security of the protocol when the numbe
r of curves in the public key increases.\n\nThis is based on joint work wi
th Paul Frixons\, Valerie Gilchrist\, Péter Kutas and Simon Merz and Lam
Pham\n\nBio: Christophe Petit is an Associate Professor at the University
of Birmingam and the Free University of Brussels. His research interests a
re in cryptography\, particularly cryptanalysis and mathematical aspects.\
n
LOCATION:https://researchseminars.org/talk/CryptoCafe/50/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Calvin Abou Haidar (NTT\, Japan)
DTSTART:20260331T140000Z
DTEND:20260331T150000Z
DTSTAMP:20260422T212834Z
UID:CryptoCafe/51
DESCRIPTION:Title: Rowhammer: how to break FALCON with one bitflip\nby Calvin Abou Ha
idar (NTT\, Japan) as part of Florida Atlantic University Crypto Café\n\n
Lecture held in SE 271.\n\nAbstract\nThe Rowhammer attack is a fault-injec
tion technique leveraging the density of RAM modules to trigger persistent
hardware bit flips that can be used for probing or modifying protected da
ta. In this paper\, we show that Falcon\, the hash-and-sign signature sche
me over NTRU lattices selected by NIST for standardization\, is vulnerable
to an attack using Rowhammer. Falcon's Gaussian sampler is the core compo
nent of its security\, as it allows to provably decorrelate the short basi
s used for signing and the generated signatures. Other schemes\, lacking t
his guarantee (such as NTRUSign\, GGH or more recently Peregrine) were pro
ven insecure. However\, performing efficient and secure lattice Gaussian s
ampling has proved to be a difficult task\, fraught with numerous potentia
l vulnerabilities to be exploited. To avoid timing attacks\, a common tech
nique is to use distribution tables that are traversed to output a sample.
The official Falcon implementation uses this technique\, employing a hard
coded reverse cumulative distribution table (RCDT). Using Rowhammer\, we t
arget Falcon's RCDT to trigger a very small number of targeted bit flips\,
and prove that the resulting distribution is sufficiently skewed to perfo
rm a key recovery attack. Namely\, we show that a single targeted bit flip
suffices to fully recover the signing key\, given a few hundred million s
ignatures\, with more bit flips enabling key recovery with fewer signature
s. Interestingly\, the Nguyen–Regev parallelepiped learning attack that
broke NTRUSign\, GGH and Peregrine does not readily adapt to this setting
unless the number of bit flips is very large. However\, we show that combi
ning it with principal component analysis (PCA) yields a practical attack.
This vulnerability can also be triggered with other types of persistent f
ault attacks on memory like optical faults. We suggest cheap countermeasur
es that largely mitigate it\, including rejecting signatures that are unus
ually short.\n\nAbout the speaker: Dr. Abou Haidar is a post-doc at NTT So
cial Informatics Laboratories in Tokyo. His research topic is lattice base
d constructions of basic cryptographic primitives\; he's been recently inv
estigating side-channel attacks on post-quantum schemes.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/51/
END:VEVENT
END:VCALENDAR