Skip to main content

Questions tagged [cryptography]

Questions on the mathematics behind cryptography, cryptanalysis, encryption and decryption, and the making and breaking of codes and ciphers.

120 votes
5 answers
181k views

Finding a primitive root of a prime number

How would you find a primitive root of a prime number such as 761? How do you pick the primitive roots to test? Randomly? Thanks
user avatar
91 votes
6 answers
21k views

Mathematically, why was the Enigma machine so hard to crack?

Mathematically, why was the Enigma machine so hard to crack? In laymen terms, what was it exactly that made cracking the Enigma machine such a formidable task? Everything I have seen about the Enigma ...
Daniel W. Farlow's user avatar
60 votes
4 answers
16k views

Would a proof to the Riemann Hypothesis affect security?

If a solution was found to the Riemann Hypothesis, would it have any effect on the security of things such as RSA protection? Would it make cracking large numbers easier?
Freeman's user avatar
  • 5,459
42 votes
2 answers
28k views

Why are very large prime numbers important in cryptography?

Firstly, you guys are awesome, and I learn quite a bit just from reading the questions of others. Secondly, a friend asked me recently why large primes are important for data security, and I was ...
sova's user avatar
  • 1,757
39 votes
3 answers
3k views

What is an elliptic curve, and how are they used in cryptography?

I hear a lot about Elliptic Curve Cryptography these days, but I'm still not quite sure what they are or how they relate to crypto...
bdonlan's user avatar
  • 871
32 votes
2 answers
12k views

Proving the Riemann Hypothesis and Impact on Cryptography

I was talking with a friend last night, and she raised the topic of the Clay Millennium Prize problems. I mentioned that my "favorite" problem is the Riemann Hypothesis; I explained what it posits ...
apnorton's user avatar
  • 17.8k
31 votes
7 answers
17k views

Is there a way to find the log of very large numbers?

I should like to evaluate $\log_2{256!}$ or other large numbers to find 'bits' of information. For example, I'd need three bits of information to represent the seven days of the week since $\lceil \...
Red Book 1's user avatar
23 votes
3 answers
4k views

RSA in plain English

I'm a computer science student, I'm not a mathematician, I don't know anything about number or group theory. I'm looking at RSA, and I want to understand it. I know what Fermats's little theorem and ...
nkint's user avatar
  • 1,823
21 votes
2 answers
2k views

Homomorphic Compression

Can there be an algorithm such that, given plaintext data P,Q, and compression function e, Such that if we treat P and Q as a number (a series of bits): $$\begin{eqnarray*}e(P + Q)& =& e(P) +...
Sidharth Ghoshal's user avatar
19 votes
3 answers
5k views

Why does (1/3) mod 3016 = 2011?

So I am taking a class where we are working on a cryptography section. Basically, the course says that: $$\frac 1 3 \mod(3016) = 2011$$ or when run through Python - modified with SciPi: $$\frac 1 3 \,...
Zack's user avatar
  • 293
19 votes
4 answers
5k views

good books on Abstract Algebra and Cryptography for self-study

I want to self-study some abstract algebra and cryptography during the summer, so what are some of books that are suitable for self-study? I have very limited background in algebra and none in ...
18 votes
2 answers
4k views

Book recomendation for Elliptic-curve cryptography

I have already taken a course on Cryptography, The course focused mainly on the public-key cryptography based on the algebraic structure of elliptic curves over finite fields. Now, I would like to ...
Darío A. Gutiérrez's user avatar
18 votes
3 answers
11k views

RSA: How Euler's Theorem is used?

I'm trying to understand the working of RSA algorithm. I am getting confused in the decryption part. I'm assuming $$n = pq$$ $$m = \phi(n) = (p - 1)(q - 1)$$ E is the encryption key $\gcd(\phi(n), ...
sauravrt's user avatar
  • 733
16 votes
4 answers
57k views

How to break XOR cipher with repeating key?

I need to crack a stream cipher with a repeating key. The length of the key is definitely 16. Each key can be any of the characters numbered 32-126 in ASCII. The algorithm goes like this: Let's say ...
user avatar
16 votes
2 answers
947 views

Does the Riemann hypothesis guarantee that integer factorization is difficult?

In an exchange of comments at Is there any mathematical conjecture that is successfully applied in the real world in spite of being yet unproven?, user R.J. Etienne claims that RH guarantees that ...
joriki's user avatar
  • 239k

15 30 50 per page
1
2 3 4 5
129