Mark's user avatar
Mark's user avatar
Mark's user avatar
Mark
  • Member for 6 years, 10 months
  • Last seen this week
2 votes

LWE assumption in cryptographic applications

2 votes

Question on Number Theoretic Transformation (NTT) Condition

2 votes

Can someone explain in simple terms how coding part and the algorithm itself, of dilithium pqc signature algorithm resemble here?

2 votes
Accepted

About multiply by constant of LWE

2 votes

Good references to breakable limits: $2^{60}$

2 votes

Computing the intersection of two lattices

2 votes

Is it possible to deduce the input of a hash by running in reverse?

2 votes

LWE KEMs and message coding

2 votes

Hiding sum of vectors. Hardness based on CVP

2 votes
Accepted

Is $0/1$ error ok in LWE?

2 votes

LWE and distributions

2 votes

What weaknesses are worth investigating in this non-linear matrix cipher?

2 votes

Are security assumptions based on quantum computers too strict? Causing cryptographers to tie their own hands

2 votes
Accepted

Can the runtime of a reduction help an adversary distinguish the reduction from the adversary's challenger?

2 votes

Is it faster to decrypt than to encrypt in all cryptography systems?

2 votes

Hash Output Distribution for Partly Randomised Input

2 votes

How to interpret my professor's statement about "seed" and "symmetric-key encryption"?

2 votes

Are PRNGs Key Derivation Functions?

2 votes

Testing of PQC NIST round3 submissions

2 votes
Accepted

Is it possible to send a file that cannot be opened or copied by the reciever, but only by a pre made program?

2 votes
Accepted

Does CPA model the challenge plaintext are the same

2 votes
Accepted

Constraints on q for q-ary lattices?

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 - Encrypting/Decrypting messages bigger than 1 bit

2 votes
Accepted

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

2 votes
Accepted

LWE and extended trapdoor claw free functions

2 votes

Fully Homomorphic Encryption Scheme?

2 votes

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

2 votes

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

2 votes

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

1
4 5
6
7 8
12