Lines Matching refs:premaster
3382 * Receive G^Y mod P, premaster = (G^Y)^X mod P
3462 * Prepare to decrypt the premaster using own private RSA key
3480 * Decrypt the premaster secret
3525 unsigned char *pms = ssl->handshake->premaster + pms_offset;
3569 * successful. In particular, always generate the fake premaster secret,
3585 if (sizeof(ssl->handshake->premaster) < pms_offset ||
3586 sizeof(ssl->handshake->premaster) - pms_offset < 48) {
3710 ssl->handshake->premaster,
3768 handshake->premaster, sizeof(handshake->premaster),
3802 ssl->handshake->premaster,
3844 * decrypt the encrypted premaster secret, so skip
3889 unsigned char *pms = ssl->handshake->premaster;
3890 unsigned char *pms_end = pms + sizeof(ssl->handshake->premaster);
3963 /* As RFC 5489 section 2, the premaster secret is formed as follows:
3969 unsigned char *psm = ssl->handshake->premaster;
3971 psm + sizeof(ssl->handshake->premaster);
4051 ssl->handshake->premaster, 32, &ssl->handshake->pmslen,