Skip to content

Instantly share code, notes, and snippets.

View itzmeanjan's full-sized avatar
😎
Working ...

Anjan Roy itzmeanjan

😎
Working ...
255 followers · 0 following
View GitHub Profile
@itzmeanjan
itzmeanjan / dilithium_kat_generation.patch
Last active December 12, 2022 06:56
Git Patch to Generate Known Answer Tests ( KATs ) from Dilithium Reference Implementation
diff --git a/ref/hex_print.h b/ref/hex_print.h
new file mode 100644
index 0000000..7afd872
--- /dev/null
+++ b/ref/hex_print.h
@@ -0,0 +1,9 @@
+#include <stdio.h>
+#include <stdint.h>
+
+inline void to_hex(const uint8_t *const bytes, const size_t blen) {
@itzmeanjan
itzmeanjan / kyber_kat_generation.patch
Last active December 12, 2022 06:55
Git Patch to Generate Known Answer Tests ( KATs ) from Kyber Reference Implementation
diff --git a/ref/hex_print.h b/ref/hex_print.h
new file mode 100644
index 0000000..7afd872
--- /dev/null
+++ b/ref/hex_print.h
@@ -0,0 +1,9 @@
+#include <stdio.h>
+#include <stdint.h>
+
+inline void to_hex(const uint8_t *const bytes, const size_t blen) {
@itzmeanjan
itzmeanjan / test_montgomery_arithmetic.py
Last active August 5, 2022 18:04
Montgomery Modular Arithmetic for 256 -bit `secp256k1` Prime Field
#!/usr/bin/python3
from math import ceil
from typing import List, Tuple
from random import randint
def bit_count(num: int) -> int:
'''
Same as len(bin(num)[2:])
@itzmeanjan
itzmeanjan / recovery.rs
Last active February 25, 2022 12:50
Reed Solomon Erasure Coded Data Recovery with (I)FFT
use dusk_plonk::fft::EvaluationDomain;
use dusk_plonk::prelude::BlsScalar;
mod utils {
use dusk_plonk::fft::EvaluationDomain;
use dusk_plonk::prelude::BlsScalar;
use rand::rngs::StdRng;
use rand::{Rng, SeedableRng};
use std::time::{SystemTime, UNIX_EPOCH};
@itzmeanjan
itzmeanjan / dft.cpp
Last active November 17, 2021 14:34
⭐️ Parallel DFT on GPGPU, using SYCL DPC++ 🔥
#include <CL/sycl.hpp>
#include <chrono>
#include <complex>
#include <iostream>
using namespace sycl;
typedef std::complex<double> cmplx;
constexpr uint N = 1 << 10;
constexpr uint B = 1 << 5;
@itzmeanjan
itzmeanjan / cholesky_factorization.cpp
Created October 18, 2021 14:48
👽 Parallel Cholesky Factorization targeting Accelerators, using SYCL DPC++ 🔥
#include <CL/sycl.hpp>
#include <chrono>
#include <iostream>
#include <random>
using namespace sycl;
const uint N = 1 << 10;
const uint B = 1 << 5;
const float MULT_FACTOR = .5f;
@itzmeanjan
itzmeanjan / determinant.py
Last active October 21, 2021 03:52
Computing Determinant of Square Matrix using Condensation Method
#!/usr/bin/python3
import numpy as np
from copy import deepcopy
from functools import reduce
from time import time
N = 1 << 8
'''
@itzmeanjan
itzmeanjan / improved_lu_decomposition.cpp
Last active October 15, 2021 06:36
🏃‍♂️ Fast, Parallel LU Factorization, using SYCL DPC++ 🏅
#include <CL/sycl.hpp>
#include <chrono>
#include <iostream>
#include <random>
using namespace sycl;
constexpr uint N = 1 << 10;
constexpr uint B = 1 << 6;
@itzmeanjan
itzmeanjan / lu_decomposition.cpp
Last active October 11, 2021 05:43
✨ Parallel LU Decomposition on GPGPU, using SYCL DPC++ 🔆
#include <CL/sycl.hpp>
#include <chrono>
#include <iostream>
#include <random>
using namespace sycl;
constexpr uint N = 1 << 10;
constexpr uint B = 1 << 5;
@itzmeanjan
itzmeanjan / gauss_jordan.cpp
Created September 27, 2021 11:13
🔥 Solving System of Linear Equations on GPGPU, using SYCL DPC++ ( GAUSS-JORDAN Method ) 👌
#include <CL/sycl.hpp>
#include <chrono>
#include <iostream>
#include <random>
using namespace sycl;
constexpr uint N = 1024;
constexpr uint B = 32;