# Cryptographic Reference Problems

## RSA Related

### FACTORING

Integer factorisation: Given positive

i.e. find the distinct

### SQRROOT

Given

### RSAP

Do RSA in reverse:

Given a private key

### Comparison

SQRROOT

So it is just as hard to solve SQRROOT as it is FACTORING.

RSAP

So reversing RSA is no harder than FACTORING, but it could be easier. This is an unknown.

## Diffie-Hellman related

### DLP

The Discrete Logarithm Problem:

Given a prime

### DHP

The Diffie-Hellman problem:

Given a prime

### Comparison

DHP