Newest Questions
31,719 questions
0
votes
1
answer
20
views
www. domain name certificates
As you know, browsers provide www. domain name certificates which involves:
Subjects name
Issuers name
Public key info
...
...
and so forth with different type of cypher's.
My problem is - I can't ...
- 1
0
votes
0
answers
7
views
Hardware Reverse Engineering FPGA LUTs for AES Analysis
I've been reading up on hardware reverse engineering, specifically in the context of FPGAs and how one might retrieve critical information like the contents of Lookup Tables (LUTs).
After ...
- 1
-1
votes
0
answers
16
views
I have managed to solve most of the parts but need to make sure if part d is done right [closed]
QUESTION 2
In the following, let $p = 13$, $q = 19$, and $e = 11$.
What mathematical problem, believed to be intractable, is the security of RSA public key encryption based upon? [3 marks]
Show how ...
0
votes
0
answers
15
views
Given $p, g, e, g^u, g^{u/a}, g^{u/(ab)}, g^{tb}$, how is it hard to compute $e(g,g)^{tu}$ or distinguish it from random?
Given $p, g, e, g^u, g^{u/a}, g^{u/(ab)}, g^{tb}$, how is it hard to compute $e(g,g)^{tu}$ or distinguish it from random?
What standard problems can be used to prove the complexity of the above ...
0
votes
0
answers
30
views
Is there a blind signature scheme that ensures the (user, message) pair can be only signed once
I'm recently reading about some e-voting schemes, and it seems that such schemes usually need a e-mail/physical setup for each voting procedure. (Well, mostly some really old books. Searched for ...
- 1
3
votes
2
answers
378
views
How can I make a Streaming Cipher Self-Synchronizing - and why?
First, let's make it clear what I think a Self-Synchronizing (asynchronous) cipher is:
Encryption:
...
- 239
3
votes
0
answers
34
views
NTT vs. Karatsuba for polynomial ring multiplication
Say there exists a polynomial Ring $R = Z_p[X]/X^N + 1$ where $N$ is a large power of 2 (say greater than or equal to $2^{14}$, $N|p-1$, and $p$ is a large prime (say greater than or equal to 32 bits)....
- 41
-1
votes
1
answer
101
views
Found collision in fnv132 hash
I'm experimenting with hash functions in PHP using the built-in hash() function... and I've stumbled upon something interesting: I have found collision in fnv132 ...
0
votes
1
answer
79
views
Would re-ordering encoded text be more secure?
I use a cipher for enciphering logins and passwords in plain text - the key is long. I have also added code that detects if any patterns occur so that they can be removed. For example:
...
- 21
0
votes
0
answers
55
views
Are qr codes secure from brute force?
I recently came across a blurry qr code which i am trying to recover some information from, So i wondering if i would know the total squares of the qr code i would brute force the black and white ...
5
votes
1
answer
551
views
Why was the value of modulus (q) chosen small in KYBER and large in DILITHIUM?
In the KYBER key agreement algorithm, the mathematical condition dictates that $n|q-1$ and for the NTT implementation, the value of $q$ was chosen to be $3329$. In the DILITHIUM digital signature ...
- 455
2
votes
1
answer
65
views
About obfuscating re-encryption: the first construction is not a obfuscator
An intuitive understanding of obfuscated re-encryption:
A third party with a re-encryption program learns no more from the re-
encryption program than from interaction with a black-box oracle that
...
- 137
2
votes
0
answers
48
views
Change KYBER KEM parameters
It seems that in the KYBER KEM algorithm, by changing some parameters (or subfunctions), higher speed can be achieved, of course, security is sacrificed a little! For example, the type of distribution ...
- 455
0
votes
0
answers
52
views
Master-slave encryption/decryption keys
Are there any cryptosystems capable of having a hierarchy of keys wherein parent keys can decrypt ciphertexts made using descendant keys?
- 3,905
1
vote
1
answer
67
views
Proving that one discrete logarithm is the square or inverse of another one
In Proof systems for general
statements about discrete
logarithms, at the very end, under "open problems", the authors have this sentence:
An interesting open problem is the design of ...
