Skip to main content
Mark Schultz-Wu's user avatar
Mark Schultz-Wu's user avatar
Mark Schultz-Wu's user avatar
Mark Schultz-Wu
Moderator
  • Member for 7 years
  • Last seen this week
2 votes

How can we measure the security levels of post-quantum cryptographic algorithms? Is there a standard way of this measurement?

2 votes
Accepted

LWE and extended trapdoor claw free functions

2 votes
Accepted

The existence of OWFs vs $\mathbf{EXP} \neq \mathbf{BPP}$

2 votes

Fast fully homomorphic arithmetic scheme? BFV = slow bootstrapping, TFHE = slow arithmetic

2 votes
Accepted

Can Shor's algorithm factor over the gaussian integers?

2 votes

Fully Homomorphic Encryption Scheme?

2 votes
Accepted

"randomized" indistinguishability vs "deterministic" indistinguishability

2 votes

Why is the security level defined by $\log _{2} \inf \{ t_{i}/\varepsilon_{i} \mid i \in I \}$

2 votes

Do ideal non-cyclotomic lattices provide better compression in lattice-based cryptography?

2 votes

IND-CPA secure PKE from search problem

2 votes
Accepted

Question about Theorem 2 in CRYSTALS-Kyber Paper

2 votes
Accepted

How does the SWIFFT algorithm relate finding hash collisions to a lattice problem?

2 votes

CKKS encoding notation and doubt with why project to base

2 votes

Compression and Decompression in CRYSTALS-Kyber

2 votes

Question on the proof of correctness in CRYSTALS-Kyber

2 votes

Definition of Polynomial-Time Indistinguishability

2 votes

What arithmetic operations are supported from fully homomorphic encryptions(FHE)?

2 votes
Accepted

How to understand these concepts in HE: Bootstrapping, Modular Switching, Key Switching, Evaluation, Relinearization?

2 votes
Accepted

Expectation of the size of algebraic norm in power of two cyclotomic field

2 votes

About the definition of distinguishing advantage and computational indistinguishability

2 votes

In reduction from search LWE to decsion LWE why sampling needs to repeat a polynomial number of times?

2 votes

Why do we need the leftover hash lemma for this hybrid proof (Learning with Errors)?

2 votes
Accepted

Why we need to consider a probability ensemble and not just a probability distribution in the definition of Security under Simulation?

2 votes

Example of bad basis for lattices (worst-case for LLL)

2 votes
Accepted

LWE encryption error

2 votes
Accepted

How to calculate probability of cracking a password from entropy?

2 votes
Accepted

How "unorthogonal" can a LLL-reduced basis be?

2 votes

Why did post-quantum key exchanges go extinct?

2 votes

LWE KEMs and message coding

2 votes

Hiding sum of vectors. Hardness based on CVP

1
5 6
7
8 9
13