Sooraj SathyanarayananDec 10, 2024

Excited to see continued progress in quantum computing with Willow's 100+ qubit milestone! This development makes research in post-quantum cryptography even more relevant, particularly the promising work on implementing lattice-based signature schemes for resource-constrained devices.

#QuantumComputing #Cryptography #PostQuantum #CyberSecurity #LatticeCrypto #Research

OPSEC Cybersecurity News LiveMar 23, 2023
Reducing exact SVP to exact SIVP

https://crypto.stackexchange.com/questions/105799/reducing-exact-svp-to-exact-sivp

#latticecrypto #reduction
Reducing exact SVP to exact SIVP

In "Efficient reductions among lattice problems" by Micciancio (2007) it is said, that SVP reduces to SIVP in their exact versions. I did not found anything about this fact, is a reductio...

Cryptography Stack Exchange
OPSEC Cybersecurity News LiveMar 5, 2023
Equivalence of lattice definitions

https://crypto.stackexchange.com/questions/105492/equivalence-of-lattice-definitions

#latticecrypto
Equivalence of lattice definitions

I have come across two supposedly identical definitions of lattices in the lattice crypto literature. There are mainly these two definitions of lattices, the first considers lattices as discrete ad...

Cryptography Stack Exchange
OPSEC Cybersecurity News LiveFeb 15, 2023
The successive minima of a lattice

https://crypto.stackexchange.com/questions/104202/the-successive-minima-of-a-lattice

#latticecrypto
The successive minima of a lattice

I am new to lattice theory. I hope(will be grateful) that one could explain to me this claim 7 in REGEV course(this claim appears in this file page 6 : https://cims.nyu.edu/~regev/teaching/

Cryptography Stack Exchange
OPSEC Cybersecurity News LiveFeb 8, 2023
NTRUEncrypt proof that there are plenty of keys

https://crypto.stackexchange.com/questions/104103/ntruencrypt-proof-that-there-are-plenty-of-keys

#latticecrypto #keygeneration
NTRUEncrypt proof that there are plenty of keys

In NTRU algorithm one is supposed generate a vector which is invertible as a polynomial in both $(Z/pZ[x])/(x^n-1)$ and $(Z/qZ[x])/(x^n-1)$. But is there a mathematical lower bound to the probabili...

Cryptography Stack Exchange
OPSEC Cybersecurity News LiveJan 2, 2023
NTRUEncrypt fails on sedonion algebra

https://crypto.stackexchange.com/questions/103544/ntruencrypt-fails-on-sedonion-algebra

#latticecrypto #publickey #ntru
NTRUEncrypt fails on sedonion algebra

This question is a direct follow-up (hopefully - the last) of my previous one; please see it for full information. I would like to further generalise NTRU cryptosystem on higher-order algebras. Fol...

Cryptography Stack Exchange
OPSEC Cybersecurity News LiveDec 13, 2022
Break Lattice-Based Cryptography with Variational Quantum Algorithm (only 25 k. Qbits for Kyber1024)?

https://crypto.stackexchange.com/questions/103230/break-lattice-based-cryptography-with-variational-quantum-algorithm-only-25-k

#postquantumcryptography #quantumcryptography #latticecrypto #nist #lwe
Break Lattice-Based Cryptography with Variational Quantum Algorithm (only 25 k. Qbits for Kyber1024)?

I am currently writing a seminar paper on Kyber and other lattice-based methods. I was so excited about the lattice-based methods that I also currently searched quantum algorithms to solve the meth...

Cryptography Stack Exchange