Tag: modular-arithmetic
Found 199 results for 'modular-arithmetic'.
1) diffie-hellman - Discrete Logarithm: Given a p, what does it mean to find the discrete logarithm of x to base y?
2) diffie-hellman - Can Eve break this public key cryptosystem if she can solve DLP or DHP?
3) factoring - Square roots, prime factorization
4) rsa - How difficult is it to brute force d in RSA: d = (1/e) mod φ in a CPT attack?
5) dsa - ECDSA: How to retrieve a non-random k
6) rsa - Is there a general formula for the number of different sequences produced with $x\mapsto x^\alpha \mod N$?
7) elliptic-curves - How can I exploit the structure of the secp256k1 prime for fast arithmetic?
8) public-key - find $a$ and $k$ for a given el gamal cryptosystem
9) elliptic-curves - ecdsa nonce reuse to compute the private key, modular inverse question
10) diffie-hellman - Discrete logarithm weak group
11) public-key - How to find the inverse of a polynomial in NTRU-PKCS
12) algorithm-design - Factoring large $N$ given oracle to find square roots modulo $N$
13) modular-arithmetic - Why does this square root algorithm work?
14) rsa - lcm versus phi in RSA
15) elliptic-curves - ECC - Point Addition/Point Multiplication
16) elliptic-curves - Modulo p in Elliptic Curve Cryptography
17) elliptic-curves - Base point in Ed25519?
18) modular-arithmetic - My pencil and paper One Time Pad works fine without modular math ...... or does it?
19) elliptic-curves - Question about using Montgomery form for elliptic curve operations on bls12-381
20) cryptanalysis - Solving the discrete logarithm problem for a weak group
21) rsa - Calculating RSA private exponent when given public exponent and the modulus factors using extended Euclid
22) rsa - RSA: How to calculate the private exponent?
23) discrete-logarithm - Index Calculus for Discrete Logarithm
24) rsa - How secure is a projection to a subspace with much lower member size for $x\mapsto x^a$ mod $N = PQ$, $P=2p+1$, $Q=2qr+1$, to target space $r=2abc+1$?
25) homomorphic-encryption - Homomorphic Encryption and the Approximate GCD Problem Confusion
26) modular-arithmetic - Is there a quick method of listing certain elements of a cyclic group?
27) rsa - In RSA, why is it important to choose e so that it is coprime to φ(n)?
28) discrete-logarithm - Is the member sum of a subset of $\mathbb{Z}/p\mathbb{Z}$ known (with $g^n \bmod p$)? Is it always $\mod P = 0$?
29) modular-arithmetic - Given $N$ with $d$ prime factors. Can the number of unique values $x^d \mod N$ calculated for $d>2$? Does the total amount decrease at some point?
30) modular-arithmetic - Given a cycle $x \mapsto x^a$ with his starting point $x_1$. Can another starting point $x_2$ be transformed to generate the same cycle?
31) elliptic-curves - Multiplying integers modulo $2^{255}-19$ using the Curve25519 polynomial reduction algorithm
32) rsa - RSA given d and d = p
33) rsa - Is there a problem with this specific RSA protocol?
34) modular-arithmetic - Is there a formula for calculating the inverse of a sum in modular arithmetic?
35) elliptic-curves - Modular reduction for NIST prime P256-- understanding the data
36) diffie-hellman - Is there a problem using Diffie-Hellman over a Mersenne prime?
37) rsa - RSA smaller number work-out-by-hand not working - I think I made a mistake
38) homomorphic-encryption - How to perform homomorphic multiplication in ElGamal?
39) discrete-logarithm - What makes the Discrete Logarithm Problem hard?
40) modular-arithmetic - Finding $x$'s parity in the discrete log problem
41) discrete-logarithm - Incorrect solution for Discrete Log Problem when using the Index Calculus algorithm
42) cryptanalysis - Modular Reduction of polynomials in GF(2^m)
43) elliptic-curves - Understanding simplification steps when solving complicated equations in Galois Field
44) modular-arithmetic - How is it possible that $g^q \equiv 1 \pmod p$ for a generator g?
45) elliptic-curves - Why are there different versions of the Pohlig-Hellman attack?
46) rsa - How to calculate RSA CRT parameters from public key and private exponent
47) modular-arithmetic - How to avoid side channel attacks when handling large numbers?
48) elliptic-curves - Why computation of $u*v^3*(u*v^7)^{(p-5)/8}$ is suggested instead of $(u/v)^{(p+3)/8}$
49) rsa - Breaking RSA with knowledge of the secret key $(n, d)$
50) rsa - RSA: Fermat's Little Theorem and the multiplicative inverse relationship between mod n and mod phi(n)