List questions from cryptography

Published on 03 Feb 2017 - 16:59

60

Views

Soft Question: What would be the ramifications if there was an easy method found to factor any number into the product of its primes?

Published on 04 Feb 2017 - 20:00

3.4k

Views

What's the function poly() ??

Published on 05 Feb 2017 - 20:06

5.7k

Views

Finding the encryption key for a cipher given the plaintext and the ciphertext

Published on 09 Feb 2017 - 19:49

298

Views

Number of encrypting $n\times n$ matrices modulo 26

Published on 09 Feb 2017 - 20:44

2.2k

Views

Solving the congruence $x^2 \equiv 4 \mod 105$. Is there an alternative to using Chinese Remainder Theorem multiple times?

Published on 28 Mar 2026 - 2:05

72

Views

Learning about Proofs and how to write them? (A programmer's perspective)

Published on 12 Feb 2017 - 8:57

2k

Views

Elliptic Curve: point of prime order $n$

Published on 13 Feb 2017 - 11:57

393

Views

Weil Pairing Intuition Help

Published on 14 Feb 2017 - 15:43

1.1k

Views

Why do we pick ax + b when doing universal hashing?

Published on 25 Mar 2026 - 16:06

92

Views

How to decode fast RSA with prime number in base

Published on 18 Feb 2017 - 15:21

507

Views

Modular cycles of $a^k \mod p$ and Fermat's Little Theorem

Published on 22 Feb 2017 - 20:11

71

Views

Factors of integers of the form $p-2^\lambda n$.

Published on 25 Feb 2017 - 21:20

42

Views

What kind of Encryption to use?

Published on 26 Feb 2017 - 14:26

264

Views

Prove that $D(E(x))=(E(x))^d \mod N=(x^e \mod N)^d \mod N=x$

Published on 27 Feb 2017 - 12:02

List Question

Faster way to encrypt or decrypt

Soft Question: What would be the ramifications if there was an easy method found to factor any number into the product of its primes?

What's the function poly() ??

Finding the encryption key for a cipher given the plaintext and the ciphertext

Number of encrypting $n\times n$ matrices modulo 26

Solving the congruence $x^2 \equiv 4 \mod 105$. Is there an alternative to using Chinese Remainder Theorem multiple times?

Learning about Proofs and how to write them? (A programmer's perspective)

Elliptic Curve: point of prime order $n$

Weil Pairing Intuition Help

Why do we pick ax + b when doing universal hashing?

How to decode fast RSA with prime number in base

Modular cycles of $a^k \mod p$ and Fermat's Little Theorem

Factors of integers of the form $p-2^\lambda n$.

What kind of Encryption to use?

Prove that $D(E(x))=(E(x))^d \mod N=(x^e \mod N)^d \mod N=x$

Trending Questions

Popular # Hahtags

Popular Questions