-
Notifications
You must be signed in to change notification settings - Fork 31
/
modhex.c
183 lines (159 loc) · 4.34 KB
/
modhex.c
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
/* modhex.c --- Simple ModHex conversion command line tool.
*
* Written by Simon Josefsson <simon@josefsson.org>.
* Copyright (c) 2006-2012 Yubico AB
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* * 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.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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 COPYRIGHT
* OWNER 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.
*
*/
#include "yubikey.h"
#include <stdio.h>
#include <stdlib.h>
int
main (int argc, char *argv[])
{
int argi;
int decode_p = 0;
int hex_p = 0;
char *data;
size_t inlen;
/* Usage. */
if (argc < 2)
{
printf ("Usage: %s [-dh] <data>\n", argv[0]);
printf ("\n");
printf
("Convert input DATA as specified and print output to STDOUT.\n");
printf ("\n");
printf (" -d: Decode data (the default is to encode data).\n");
printf (" -h: Use hex encoding for all non-modhex data.\n");
printf (" DATA: string with data to encode\n");
printf ("\n");
printf ("Examples:\n");
printf ("\n");
printf (" ModHex encode ASCII-string \"test\":\n");
printf (" %s test\n", argv[0]);
printf ("\n");
printf (" Decode ModHex data \"ifhgieif\" into ASCII string:\n");
printf (" %s -d ifhgieif\n", argv[0]);
printf ("\n");
printf (" ModHex encode hex-encoded data \"b565716f\":\n");
printf (" %s -h b565716f\n", argv[0]);
printf ("\n");
printf
(" Decode ModHex data \"nghgibhv\" and print hex-encode data:\n");
printf (" %s -d -h nghgibhv\n", argv[0]);
return 1;
}
/* Command line handling. */
argi = 1;
while (argc > argi && (!decode_p || !hex_p))
{
if (strcmp (argv[argi], "-d") == 0)
{
decode_p = 1;
argi++;
}
else if (strcmp (argv[argi], "-h") == 0)
{
hex_p = 1;
argi++;
}
else
break;
}
if (argc < argi + 1)
{
printf ("error: missing argument\n");
return 1;
}
data = argv[argi];
inlen = strlen (data);
if (!decode_p && hex_p)
{
unsigned long i;
char *tmp;
if (inlen & 1)
{
printf ("error: size of hex encoded input not even\n");
return 1;
}
tmp = malloc (inlen / 2 + 1);
if (!tmp)
{
perror ("malloc");
return 1;
}
for (i = 0; i < inlen; i++)
{
const char *hex = "0123456789abcdef";
char *p;
if ((p = strchr (hex, data[i])) == NULL)
{
printf ("error: input not hex encoded at position %lu\n", i);
free (tmp);
return 1;
}
if (i & 1)
tmp[i / 2] |= p - hex;
else
tmp[i / 2] = (p - hex) << 4;
}
tmp[i / 2] = '\0';
inlen = inlen / 2;
data = tmp;
}
/* Doit. */
{
size_t i;
char *buf = malloc (2 * inlen + 1);
if (!buf)
{
perror ("malloc");
if (!decode_p && hex_p)
free (data);
return 1;
}
if (decode_p)
yubikey_modhex_decode (buf, data, inlen / 2);
else
yubikey_modhex_encode (buf, data, inlen);
if (decode_p && hex_p)
{
for (i = 0; i < inlen / 2; i++)
printf ("%02x", buf[i] & 0xFF);
printf ("\n");
}
else if (decode_p)
fwrite (buf, inlen / 2, 1, stdout);
else
printf ("%s\n", buf);
free (buf);
}
if (!decode_p && hex_p)
free (data);
return 0;
}