gammatester's user avatar
gammatester's user avatar
gammatester's user avatar
gammatester
  • Member for 10 years, 7 months
  • Last seen more than 5 years ago
8 votes
Accepted

Why is Poly1305, which is based on AES, faster than AES?

7 votes
Accepted

Decrypting a blowfish cipher with three keys

5 votes

In RSA. Why is $\phi(n)$ kept secret and $n$ is public?

4 votes

Find the generators of multiplicative group of units efficiently?

4 votes
Accepted

AES CBC: how shall i get to know with AES CBC method, the received Cipher Text is padded or not

3 votes

Why is SHA-512 limited to an input of $2^{128}$ bits?

3 votes
Accepted

Determining the primitive root $g$ of $p$, given $B=g^b \pmod p$

3 votes

How to reverse this hash function?

2 votes

Exactly two of the four roots must be greater than N/2

2 votes

Cracking plain RSA by factoring the modulus n

2 votes
Accepted

How different is SHA-512/224 when compared to SHA-512?

2 votes
Accepted

Using Euler's theorem.. how can I get appropriate x..?

1 vote

How does authentication work differently between asymmetric and symmetric cryptography?

1 vote

Break large exponent calculation into smaller calculations?

1 vote
Accepted

Why does this RSA example break when: 1) setting p or q as non-prime, or 2) setting p and q as the same number?

1 vote
Accepted

RSA encryption and decryption not resulting to the correct result?

1 vote

Given a prime exponent e and a prime number n, find b, where b^e = 1 mod n

1 vote
Accepted

Can you help me understand Pollard's rho example?

1 vote
Accepted

what is the benefit of lcm in cryptography?

1 vote
Accepted

FIPS 113 Computer Data Authentication

1 vote

can anyone explain inversion per byte?

1 vote
Accepted

how do you calculate the private exponent in asymmetric key encryption

0 votes

RSA decrypting of a huge file by parts

0 votes

In case M is small is it possible to recover the message

0 votes

RSA - Computing (p,q), given (N,e,d)

0 votes
Accepted

RSA output issue