Lines Matching defs:DH
121 public key cryptography (via PKCS \#1 RSA, DH or ECCDH), and a plethora of support routines.
3604 to attack (no sub-exponential attacks exist unlike normal DH crypto) in fact the fastest attack requires the square root
3847 Note: this function stores only the $x$ co-ordinate of the shared elliptic point as described in ANSI X9.63 ECC--DH.
3850 ECC--DH Encryption is performed by producing a random key, hashing it, and XOR'ing the digest against the plaintext. It is not strictly ANSI X9.63 compliant
3854 \subsection{ECC-DH Encryption}
3875 \subsection{ECC-DH Decryption}
4958 The following chart gives the work factor for solving a DH/RSA public key using the NFS. The work factor for a key of order
4969 \hline RSA/DH Key Size (bits) & Work Factor ($log_2$) \\
4981 \caption{RSA/DH Key Strength}
5007 \hline Security Goal & RSA/DH Key Size (bits) & ECC Key Size (bits) \\
6409 The ECC system in LibTomCrypt is based off of the NIST recommended curves over $GF(p)$ and is used to implement EC-DSA and EC-DH. The ECC functions work with
