Trevor’s Website

Introduction to CKKS

cryptography

The HEAAN / CKKS scheme introduced in the paper, Homomorphic Encryption for Arithmetic of Approximate Numbers or named after the authors, Jung Hee Cheon, Andrey Kim, Miran Kim, and Yongsoo Song is a leveled homomorphic scheme based upon the Ring Learning with Errors (RLWE) problem…

Vandermonde Matrices

mathematics

When studying linear algebra, one often comes across various types of matrices with unique properties and applications. One such matrix is the Vandermonde matrix. Named…

Cyclotomic Polynomials

mathematics

A cyclotomic polynomial is an irreducible polynomial whose roots are defined from the primitive roots of unity. The \(n\)th cyclotomic polynomial is denoted as \(\Phi_n(x)\).

Merkle Trees

cryptography

In the world of cryptography and blockchain technology, Merkle trees are a crucial data structure that plays a significant…

Fast Fourier Transform

mathematics

algorithms

The Fast Fourier Transform is a divide and conquer algorithm for computing the discrete Fourier transform of a sequence, or its inverse. Fourier analysis converts a signal from its original domain…

Verifiable Delay Functions

cryptography

A Verifiable Delay Function (VDF) is a computational primitive that introduces a time delay in evaluating a function while providing proof of its correctness. In simple terms, it is a function that…

Yao’s Garbled Circuits

cryptography

Yao’s Garbled Circuits is a cryptographic protocol introduced by Andrew Yao in 1982 that…

Oblivious Transfer

cryptography

Oblivious Transfer (OT) is a cryptographic protocol that allows one party, often referred to as the sender, to send a set of private messages to another party, known as the…

Shamir’s Secret Sharing

cryptography

In the digital age, securing sensitive information is crucial. Shamir’s Secret Sharing (SSS) is a cryptographic technique that provides a way to distribute a secret among multiple parties, ensuring that the secret can only be reconstructed when a sufficient…

Zero Knowledge Proofs

cryptography

Zero knowledge proofs (ZKPs) are a way for a prover to prove that they have knowledge of a secret without revealing the secret itself. This is done by having the prover convince the verifier…

Paper accepted into KDD 2023 Undergraduate Consortium

news

I’m thrilled to share that our paper has been accepted for presentation at the prestigious KDD conference. It’s an honor to have our research recognized by the…

Learning With Errors

cryptography

The Learning With Errors (LWE) problem is a mathematical problem that plays a significant role in modern cryptographic schemes. It is based on the concept of…

Groups, Rings, and Fields

cryptography

Groups, fields, and rings are…

Introduction to Modular Arithmetic

cryptography

Modular arithmetic is a fascinating branch of mathematics that deals with integers and their remainders. It has various applications in fields like cryptography, computer…

Shortest Vector Problem and Closest Vector Problem

cryptography

Lattice-based cryptography has emerged as a powerful tool in…

Integer Factorization Problem

cryptography

The integer factorization problem is a fundamental challenge in cryptography, with significant implications for the widely used RSA…

Discrete Logarithm Problem

cryptography

The discrete logarithm problem is a fundamental concept in the field of cryptography. It plays a crucial role in many encryption algorithms and…

Simple SHA-3

cryptography

Cryptographic algorithms such as Keccak play a crucial role in securing sensitive information, but they can often seem daunting and complex to understand. The National…

Federated Learning From Scratch

machine learning

Federated learning is a technique for machine learning that uses decentralized clients to train on…

Welcome To My Blog

news

This is the first post in a Quarto blog. Welcome!