1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266
|
/*
* keys.c
*/
#include "pgpdump.h"
private int PUBLIC;
private int VERSION;
private void old_Public_Key_Packet(void);
private void new_Public_Key_Packet(int);
private void IV(unsigned int);
private void plain_Secret_Key(int);
private void encrypted_Secret_Key(int, int);
public void
Public_Subkey_Packet(int len)
{
Public_Key_Packet(len);
}
public void
Public_Key_Packet(int len)
{
VERSION = Getc();
printf("\tVer %d - ", VERSION);
switch (VERSION) {
case 2:
case 3:
printf("old\n");
old_Public_Key_Packet();
break;
case 4:
printf("new\n");
new_Public_Key_Packet(len - 1);
break;
default:
warn_exit("unknown version (%d).", VERSION);
break;
}
}
private void
old_Public_Key_Packet(void)
{
int days;
time4("Public key creation time");
days = Getc() * 256;
days += Getc();
printf("\tValid days - %d[0 is forever]\n", days);
PUBLIC = Getc();
pub_algs(PUBLIC); /* PUBLIC should be 1 */
multi_precision_integer("RSA n");
multi_precision_integer("RSA e");
}
private void
new_Public_Key_Packet(int len)
{
key_creation_time4("Public key creation time");
PUBLIC = Getc();
pub_algs(PUBLIC);
switch (PUBLIC) {
case 1:
case 2:
case 3:
multi_precision_integer("RSA n");
multi_precision_integer("RSA e");
break;
case 16:
case 20:
multi_precision_integer("ElGamal p");
multi_precision_integer("ElGamal g");
multi_precision_integer("ElGamal y");
break;
case 17:
multi_precision_integer("DSA p");
multi_precision_integer("DSA q");
multi_precision_integer("DSA g");
multi_precision_integer("DSA y");
break;
default:
printf("\tUnknown public key(pub %d)\n", PUBLIC);
skip(len - 5);
break;
}
}
private void
IV(unsigned int len)
{
printf("\tIV - ");
dump(len);
printf("\n");
}
public void
Secret_Subkey_Packet(int len)
{
Secret_Key_Packet(len);
}
public void
Secret_Key_Packet(int len)
{
int s2k, sym;
Getc_resetlen();
Public_Key_Packet(len);
s2k = Getc();
switch (s2k) {
case 0:
plain_Secret_Key(len - Getc_getlen());
break;
case 254:
sym = Getc();
sym_algs(sym);
if (string_to_key() == YES)
IV(iv_len(sym));
encrypted_Secret_Key(len - Getc_getlen(), YES);
break;
case 255:
sym = Getc();
sym_algs(sym);
if (string_to_key() == YES)
IV(iv_len(sym));
encrypted_Secret_Key(len - Getc_getlen(), NO);
break;
default:
sym = s2k;
sym_algs(sym);
printf("\tSimple string-to-key for IDEA\n");
IV(iv_len(sym));
encrypted_Secret_Key(len - Getc_getlen(), NO);
break;
}
}
private void
plain_Secret_Key(int len)
{
switch (VERSION) {
case 2:
case 3:
/* PUBLIC should be 1. */
/* Tested by specifying a null passphrase. */
multi_precision_integer("RSA d");
multi_precision_integer("RSA p");
multi_precision_integer("RSA q");
multi_precision_integer("RSA u");
printf("\tChecksum - ");
dump(2);
printf("\n");
break;
case 4:
switch (PUBLIC) {
case 1:
case 2:
case 3:
multi_precision_integer("RSA d");
multi_precision_integer("RSA p");
multi_precision_integer("RSA q");
multi_precision_integer("RSA u");
break;
case 16:
case 20:
multi_precision_integer("ElGamal x");
break;
case 17:
multi_precision_integer("DSA x");
break;
default:
printf("\tUnknown secret key(pub %d)\n", PUBLIC);
skip(len - 2);
break;
}
printf("\tChecksum - ");
dump(2);
printf("\n");
break;
default:
printf("\tunknown version (%d)\n", VERSION);
skip(len);
break;
}
}
private void
encrypted_Secret_Key(int len, int sha1)
{
switch (VERSION) {
case 2:
case 3:
/* PUBLIC should be 1.
Printable since an MPI prefix count is not encrypted. */
multi_precision_integer("Encrypted RSA d");
multi_precision_integer("Encrypted RSA p");
multi_precision_integer("Encrypted RSA q");
multi_precision_integer("Encrypted RSA u");
printf("\tChecksum - ");
dump(2);
printf("\n");
break;
case 4:
switch (PUBLIC) {
case 1:
case 2:
case 3:
printf("\tEncrypted RSA d\n");
printf("\tEncrypted RSA p\n");
printf("\tEncrypted RSA q\n");
printf("\tEncrypted RSA u\n");
break;
case 16:
case 20:
printf("\tEncrypted ElGamal x\n");
break;
case 17:
printf("\tEncrypted DSA x\n");
break;
default:
printf("\tUnknown encrypted key(pub %d)\n", PUBLIC);
break;
}
if (sha1 == YES)
printf("\tEncrypted SHA1 hash\n");
else
printf("\tEncrypted checksum\n");
skip(len);
break;
default:
printf("\tunknown version (%d)\n", VERSION);
skip(len);
break;
}
}
/*
* Copyright (C) 1998 Kazuhiko Yamamoto
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the author nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
* OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
* IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
|