| des_locl.h (55206) | des_locl.h (62587) |
|---|---|
| 1/* $FreeBSD: head/sys/crypto/des/des_locl.h 62587 2000-07-04 16:35:15Z itojun $ */ 2/* $KAME: des_locl.h,v 1.4 2000/03/27 04:43:46 sumikawa Exp $ */ 3 |
|
| 1/* lib/des/des_locl.h */ 2/* Copyright (C) 1995-1996 Eric Young (eay@mincom.oz.au) 3 * All rights reserved. 4 * 5 * This file is part of an SSL implementation written 6 * by Eric Young (eay@mincom.oz.au). 7 * The implementation was written so as to conform with Netscapes SSL 8 * specification. This library and applications are --- 29 unchanged lines hidden (view full) --- 38 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 39 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 40 * SUCH DAMAGE. 41 * 42 * The licence and distribution terms for any publically available version or 43 * derivative of this code cannot be changed. i.e. this code cannot simply be 44 * copied and put under another distribution licence 45 * [including the GNU Public Licence.] | 4/* lib/des/des_locl.h */ 5/* Copyright (C) 1995-1996 Eric Young (eay@mincom.oz.au) 6 * All rights reserved. 7 * 8 * This file is part of an SSL implementation written 9 * by Eric Young (eay@mincom.oz.au). 10 * The implementation was written so as to conform with Netscapes SSL 11 * specification. This library and applications are --- 29 unchanged lines hidden (view full) --- 41 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 42 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 43 * SUCH DAMAGE. 44 * 45 * The licence and distribution terms for any publically available version or 46 * derivative of this code cannot be changed. i.e. this code cannot simply be 47 * copied and put under another distribution licence 48 * [including the GNU Public Licence.] |
| 46 * 47 * $FreeBSD: head/sys/crypto/des/des_locl.h 55206 1999-12-29 05:07:58Z peter $ | |
| 48 */ 49/* WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING 50 * 51 * Always modify des_locl.org since des_locl.h is automatically generated from 52 * it during SSLeay configuration. 53 * 54 * WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING 55 */ 56 57#include <sys/param.h> 58#include <sys/malloc.h> 59#include <sys/mbuf.h> 60#include <sys/systm.h> 61 62#ifndef HEADER_DES_LOCL_H | 49 */ 50/* WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING 51 * 52 * Always modify des_locl.org since des_locl.h is automatically generated from 53 * it during SSLeay configuration. 54 * 55 * WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING 56 */ 57 58#include <sys/param.h> 59#include <sys/malloc.h> 60#include <sys/mbuf.h> 61#include <sys/systm.h> 62 63#ifndef HEADER_DES_LOCL_H |
| 63#define HEADER_DES_LOCL_H | 64#define HEADER_DES_LOCL_H |
| 64 65#if defined(WIN32) || defined(WIN16) 66#ifndef MSDOS | 65 66#if defined(WIN32) || defined(WIN16) 67#ifndef MSDOS |
| 67#define MSDOS | 68#define MSDOS |
| 68#endif 69#endif 70 71/* 72#include <stdio.h> 73#include <stdlib.h> 74#ifndef MSDOS 75#include <unistd.h> --- 8 unchanged lines hidden (view full) --- 84#endif 85 86#ifdef MSDOS /* Visual C++ 2.1 (Windows NT/95) */ 87#include <stdlib.h> 88#include <errno.h> 89#include <time.h> 90#include <io.h> 91#ifndef RAND | 69#endif 70#endif 71 72/* 73#include <stdio.h> 74#include <stdlib.h> 75#ifndef MSDOS 76#include <unistd.h> --- 8 unchanged lines hidden (view full) --- 85#endif 86 87#ifdef MSDOS /* Visual C++ 2.1 (Windows NT/95) */ 88#include <stdlib.h> 89#include <errno.h> 90#include <time.h> 91#include <io.h> 92#ifndef RAND |
| 92#define RAND | 93#define RAND |
| 93#endif 94#undef NOPROTO 95#endif 96 97#if !defined(_KERNEL) && (defined(__STDC__) || defined(VMS) || defined(M_XENIX) || defined(MSDOS)) 98#ifndef __NetBSD__ 99#include <string.h> 100#endif 101#endif 102 103#ifdef __NetBSD__ 104#include <sys/systm.h> 105#endif 106 107#ifndef RAND | 94#endif 95#undef NOPROTO 96#endif 97 98#if !defined(_KERNEL) && (defined(__STDC__) || defined(VMS) || defined(M_XENIX) || defined(MSDOS)) 99#ifndef __NetBSD__ 100#include <string.h> 101#endif 102#endif 103 104#ifdef __NetBSD__ 105#include <sys/systm.h> 106#endif 107 108#ifndef RAND |
| 108#define RAND | 109#define RAND |
| 109#endif 110 111#ifdef linux 112#undef RAND 113#endif 114 115#ifdef MSDOS | 110#endif 111 112#ifdef linux 113#undef RAND 114#endif 115 116#ifdef MSDOS |
| 116#define getpid() 2 117#define RAND | 117#define getpid() 2 118#define RAND |
| 118#undef NOPROTO 119#endif 120 121#if defined(NOCONST) | 119#undef NOPROTO 120#endif 121 122#if defined(NOCONST) |
| 122#define const | 123#define const |
| 123#endif 124 125#ifdef __STDC__ 126#undef NOPROTO 127#endif 128 129#ifdef RAND | 124#endif 125 126#ifdef __STDC__ 127#undef NOPROTO 128#endif 129 130#ifdef RAND |
| 130#define srandom(s) srand(s) 131#define random rand | 131#define srandom(s) srand(s) 132#define random rand |
| 132#endif 133 | 133#endif 134 |
| 134#define ITERATIONS 16 135#define HALF_ITERATIONS 8 | 135#define ITERATIONS 16 136#define HALF_ITERATIONS 8 |
| 136 137/* used in des_read and des_write */ | 137 138/* used in des_read and des_write */ |
| 138#define MAXWRITE (1024*16) 139#define BSIZE (MAXWRITE+4) | 139#define MAXWRITE (1024*16) 140#define BSIZE (MAXWRITE+4) |
| 140 | 141 |
| 141#define c2l(c,l) (l =((DES_LONG)(*((c)++))) , \ | 142#define c2l(c,l) (l =((DES_LONG)(*((c)++))) , \ |
| 142 l|=((DES_LONG)(*((c)++)))<< 8L, \ 143 l|=((DES_LONG)(*((c)++)))<<16L, \ 144 l|=((DES_LONG)(*((c)++)))<<24L) 145 146/* NOTE - c is not incremented as per c2l */ | 143 l|=((DES_LONG)(*((c)++)))<< 8L, \ 144 l|=((DES_LONG)(*((c)++)))<<16L, \ 145 l|=((DES_LONG)(*((c)++)))<<24L) 146 147/* NOTE - c is not incremented as per c2l */ |
| 147#define c2ln(c,l1,l2,n) { \ | 148#define c2ln(c,l1,l2,n) { \ |
| 148 c+=n; \ 149 l1=l2=0; \ 150 switch (n) { \ 151 case 8: l2 =((DES_LONG)(*(--(c))))<<24L; \ 152 case 7: l2|=((DES_LONG)(*(--(c))))<<16L; \ 153 case 6: l2|=((DES_LONG)(*(--(c))))<< 8L; \ 154 case 5: l2|=((DES_LONG)(*(--(c)))); \ 155 case 4: l1 =((DES_LONG)(*(--(c))))<<24L; \ 156 case 3: l1|=((DES_LONG)(*(--(c))))<<16L; \ 157 case 2: l1|=((DES_LONG)(*(--(c))))<< 8L; \ 158 case 1: l1|=((DES_LONG)(*(--(c)))); \ 159 } \ 160 } 161 | 149 c+=n; \ 150 l1=l2=0; \ 151 switch (n) { \ 152 case 8: l2 =((DES_LONG)(*(--(c))))<<24L; \ 153 case 7: l2|=((DES_LONG)(*(--(c))))<<16L; \ 154 case 6: l2|=((DES_LONG)(*(--(c))))<< 8L; \ 155 case 5: l2|=((DES_LONG)(*(--(c)))); \ 156 case 4: l1 =((DES_LONG)(*(--(c))))<<24L; \ 157 case 3: l1|=((DES_LONG)(*(--(c))))<<16L; \ 158 case 2: l1|=((DES_LONG)(*(--(c))))<< 8L; \ 159 case 1: l1|=((DES_LONG)(*(--(c)))); \ 160 } \ 161 } 162 |
| 162#define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ | 163#define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ |
| 163 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ 164 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ 165 *((c)++)=(unsigned char)(((l)>>24L)&0xff)) 166 167/* replacements for htonl and ntohl since I have no idea what to do 168 * when faced with machines with 8 byte longs. */ | 164 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ 165 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ 166 *((c)++)=(unsigned char)(((l)>>24L)&0xff)) 167 168/* replacements for htonl and ntohl since I have no idea what to do 169 * when faced with machines with 8 byte longs. */ |
| 169#define HDRSIZE 4 | 170#define HDRSIZE 4 |
| 170 | 171 |
| 171#define n2l(c,l) (l =((DES_LONG)(*((c)++)))<<24L, \ | 172#define n2l(c,l) (l =((DES_LONG)(*((c)++)))<<24L, \ |
| 172 l|=((DES_LONG)(*((c)++)))<<16L, \ 173 l|=((DES_LONG)(*((c)++)))<< 8L, \ 174 l|=((DES_LONG)(*((c)++)))) 175 | 173 l|=((DES_LONG)(*((c)++)))<<16L, \ 174 l|=((DES_LONG)(*((c)++)))<< 8L, \ 175 l|=((DES_LONG)(*((c)++)))) 176 |
| 176#define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \ | 177#define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \ |
| 177 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ 178 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ 179 *((c)++)=(unsigned char)(((l) )&0xff)) 180 181/* NOTE - c is not incremented as per l2c */ | 178 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ 179 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ 180 *((c)++)=(unsigned char)(((l) )&0xff)) 181 182/* NOTE - c is not incremented as per l2c */ |
| 182#define l2cn(l1,l2,c,n) { \ | 183#define l2cn(l1,l2,c,n) { \ |
| 183 c+=n; \ 184 switch (n) { \ 185 case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \ 186 case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \ 187 case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \ 188 case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \ 189 case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \ 190 case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \ --- 11 unchanged lines hidden (view full) --- 202/* The changes to this macro may help or hinder, depending on the 203 * compiler and the achitecture. gcc2 always seems to do well :-). 204 * Inspired by Dana How <how@isl.stanford.edu> 205 * DO NOT use the alternative version on machines with 8 byte longs. 206 * It does not seem to work on the Alpha, even when DES_LONG is 4 207 * bytes, probably an issue of accessing non-word aligned objects :-( */ 208#ifdef DES_PTR 209 | 184 c+=n; \ 185 switch (n) { \ 186 case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \ 187 case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \ 188 case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \ 189 case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \ 190 case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \ 191 case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \ --- 11 unchanged lines hidden (view full) --- 203/* The changes to this macro may help or hinder, depending on the 204 * compiler and the achitecture. gcc2 always seems to do well :-). 205 * Inspired by Dana How <how@isl.stanford.edu> 206 * DO NOT use the alternative version on machines with 8 byte longs. 207 * It does not seem to work on the Alpha, even when DES_LONG is 4 208 * bytes, probably an issue of accessing non-word aligned objects :-( */ 209#ifdef DES_PTR 210 |
| 210#define D_ENCRYPT(L,R,S) { \ | 211#define D_ENCRYPT(L,R,S) { \ |
| 211 u=((R^s[S ])<<2); \ 212 t= R^s[S+1]; \ 213 t=ROTATE(t,2); \ 214 L^= (\ 215 *(DES_LONG *)((unsigned char *)des_SP+0x100+((t )&0xfc))+ \ 216 *(DES_LONG *)((unsigned char *)des_SP+0x300+((t>> 8)&0xfc))+ \ 217 *(DES_LONG *)((unsigned char *)des_SP+0x500+((t>>16)&0xfc))+ \ 218 *(DES_LONG *)((unsigned char *)des_SP+0x700+((t>>24)&0xfc))+ \ 219 *(DES_LONG *)((unsigned char *)des_SP +((u )&0xfc))+ \ 220 *(DES_LONG *)((unsigned char *)des_SP+0x200+((u>> 8)&0xfc))+ \ 221 *(DES_LONG *)((unsigned char *)des_SP+0x400+((u>>16)&0xfc))+ \ 222 *(DES_LONG *)((unsigned char *)des_SP+0x600+((u>>24)&0xfc))); } 223#else /* original version */ 224#ifdef undef | 212 u=((R^s[S ])<<2); \ 213 t= R^s[S+1]; \ 214 t=ROTATE(t,2); \ 215 L^= (\ 216 *(DES_LONG *)((unsigned char *)des_SP+0x100+((t )&0xfc))+ \ 217 *(DES_LONG *)((unsigned char *)des_SP+0x300+((t>> 8)&0xfc))+ \ 218 *(DES_LONG *)((unsigned char *)des_SP+0x500+((t>>16)&0xfc))+ \ 219 *(DES_LONG *)((unsigned char *)des_SP+0x700+((t>>24)&0xfc))+ \ 220 *(DES_LONG *)((unsigned char *)des_SP +((u )&0xfc))+ \ 221 *(DES_LONG *)((unsigned char *)des_SP+0x200+((u>> 8)&0xfc))+ \ 222 *(DES_LONG *)((unsigned char *)des_SP+0x400+((u>>16)&0xfc))+ \ 223 *(DES_LONG *)((unsigned char *)des_SP+0x600+((u>>24)&0xfc))); } 224#else /* original version */ 225#ifdef undef |
| 225#define D_ENCRYPT(L,R,S) \ | 226#define D_ENCRYPT(L,R,S) \ |
| 226 U.l=R^s[S+1]; \ 227 T.s[0]=((U.s[0]>>4)|(U.s[1]<<12))&0x3f3f; \ 228 T.s[1]=((U.s[1]>>4)|(U.s[0]<<12))&0x3f3f; \ 229 U.l=(R^s[S ])&0x3f3f3f3fL; \ 230 L^= des_SPtrans[1][(T.c[0])]| \ 231 des_SPtrans[3][(T.c[1])]| \ 232 des_SPtrans[5][(T.c[2])]| \ 233 des_SPtrans[7][(T.c[3])]| \ 234 des_SPtrans[0][(U.c[0])]| \ 235 des_SPtrans[2][(U.c[1])]| \ 236 des_SPtrans[4][(U.c[2])]| \ 237 des_SPtrans[6][(U.c[3])]; 238#else | 227 U.l=R^s[S+1]; \ 228 T.s[0]=((U.s[0]>>4)|(U.s[1]<<12))&0x3f3f; \ 229 T.s[1]=((U.s[1]>>4)|(U.s[0]<<12))&0x3f3f; \ 230 U.l=(R^s[S ])&0x3f3f3f3fL; \ 231 L^= des_SPtrans[1][(T.c[0])]| \ 232 des_SPtrans[3][(T.c[1])]| \ 233 des_SPtrans[5][(T.c[2])]| \ 234 des_SPtrans[7][(T.c[3])]| \ 235 des_SPtrans[0][(U.c[0])]| \ 236 des_SPtrans[2][(U.c[1])]| \ 237 des_SPtrans[4][(U.c[2])]| \ 238 des_SPtrans[6][(U.c[3])]; 239#else |
| 239#define D_ENCRYPT(Q,R,S) {\ | 240#define D_ENCRYPT(Q,R,S) {\ |
| 240 u=(R^s[S ]); \ 241 t=R^s[S+1]; \ 242 t=ROTATE(t,4); \ 243 Q^= des_SPtrans[1][(t )&0x3f]| \ 244 des_SPtrans[3][(t>> 8L)&0x3f]| \ 245 des_SPtrans[5][(t>>16L)&0x3f]| \ 246 des_SPtrans[7][(t>>24L)&0x3f]| \ 247 des_SPtrans[0][(u )&0x3f]| \ --- 35 unchanged lines hidden (view full) --- 283 14^28 15^29 -- -- 12 13 28 29 14 15 28 29 284 285 Thanks for hints from Richard Outerbridge - he told me IP&FP 286 could be done in 15 xor, 10 shifts and 5 ands. 287 When I finally started to think of the problem in 2D 288 I first got ~42 operations without xors. When I remembered 289 how to use xors :-) I got it to its final state. 290 */ | 241 u=(R^s[S ]); \ 242 t=R^s[S+1]; \ 243 t=ROTATE(t,4); \ 244 Q^= des_SPtrans[1][(t )&0x3f]| \ 245 des_SPtrans[3][(t>> 8L)&0x3f]| \ 246 des_SPtrans[5][(t>>16L)&0x3f]| \ 247 des_SPtrans[7][(t>>24L)&0x3f]| \ 248 des_SPtrans[0][(u )&0x3f]| \ --- 35 unchanged lines hidden (view full) --- 284 14^28 15^29 -- -- 12 13 28 29 14 15 28 29 285 286 Thanks for hints from Richard Outerbridge - he told me IP&FP 287 could be done in 15 xor, 10 shifts and 5 ands. 288 When I finally started to think of the problem in 2D 289 I first got ~42 operations without xors. When I remembered 290 how to use xors :-) I got it to its final state. 291 */ |
| 291#define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\ | 292#define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\ |
| 292 (b)^=(t),\ 293 (a)^=((t)<<(n))) 294 | 293 (b)^=(t),\ 294 (a)^=((t)<<(n))) 295 |
| 295#define IP(l,r) \ | 296#define IP(l,r) \ |
| 296 { \ 297 register DES_LONG tt; \ 298 PERM_OP(r,l,tt, 4,0x0f0f0f0fL); \ 299 PERM_OP(l,r,tt,16,0x0000ffffL); \ 300 PERM_OP(r,l,tt, 2,0x33333333L); \ 301 PERM_OP(l,r,tt, 8,0x00ff00ffL); \ 302 PERM_OP(r,l,tt, 1,0x55555555L); \ 303 } 304 | 297 { \ 298 register DES_LONG tt; \ 299 PERM_OP(r,l,tt, 4,0x0f0f0f0fL); \ 300 PERM_OP(l,r,tt,16,0x0000ffffL); \ 301 PERM_OP(r,l,tt, 2,0x33333333L); \ 302 PERM_OP(l,r,tt, 8,0x00ff00ffL); \ 303 PERM_OP(r,l,tt, 1,0x55555555L); \ 304 } 305 |
| 305#define FP(l,r) \ | 306#define FP(l,r) \ |
| 306 { \ 307 register DES_LONG tt; \ 308 PERM_OP(l,r,tt, 1,0x55555555L); \ 309 PERM_OP(r,l,tt, 8,0x00ff00ffL); \ 310 PERM_OP(l,r,tt, 2,0x33333333L); \ 311 PERM_OP(r,l,tt,16,0x0000ffffL); \ 312 PERM_OP(l,r,tt, 4,0x0f0f0f0fL); \ 313 } 314#endif 315 316 317/* | 307 { \ 308 register DES_LONG tt; \ 309 PERM_OP(l,r,tt, 1,0x55555555L); \ 310 PERM_OP(r,l,tt, 8,0x00ff00ffL); \ 311 PERM_OP(l,r,tt, 2,0x33333333L); \ 312 PERM_OP(r,l,tt,16,0x0000ffffL); \ 313 PERM_OP(l,r,tt, 4,0x0f0f0f0fL); \ 314 } 315#endif 316 317 318/* |
| 318#define mbuf2char(i_mbuf, i_index, in) \ | 319#define mbuf2char(i_mbuf, i_index, in) \ |
| 319 { \ | 320 { \ |
| 320 register int i; \ 321 struct mbuf *m; \ | 321 register int i; \ 322 struct mbuf *m; \ |
| 322 char *buf; \ 323 m = i_mbuf; \ 324 for (i = 0; i < 8; i ++){ \ 325 if (i_index + i == m->m_len){ \ 326 m = m->m_next; \ 327 } \ 328 buf = mtod(m, char *); \ 329 in[i] = *(buf + i); \ 330 } 331 332 | 323 char *buf; \ 324 m = i_mbuf; \ 325 for (i = 0; i < 8; i ++){ \ 326 if (i_index + i == m->m_len){ \ 327 m = m->m_next; \ 328 } \ 329 buf = mtod(m, char *); \ 330 in[i] = *(buf + i); \ 331 } 332 333 |
| 333#define char2mbuf(o_mbuf, o_index, out) \ | 334#define char2mbuf(o_mbuf, o_index, out) \ |
| 334 { \ | 335 { \ |
| 335 register int i; \ 336 struct mbuf *m; \ | 336 register int i; \ 337 struct mbuf *m; \ |
| 337 char *buf; \ 338 m = o_mbuf; \ 339 for (i = 0; i < 8; i ++){ \ 340 if (i_index + i == m->m_len){ \ 341 m = m->m_next; \ 342 } \ 343 buf = mtod(m, char *); \ 344 *(buf + i) = out[i]; \ 345 } 346*/ 347 | 338 char *buf; \ 339 m = o_mbuf; \ 340 for (i = 0; i < 8; i ++){ \ 341 if (i_index + i == m->m_len){ \ 342 m = m->m_next; \ 343 } \ 344 buf = mtod(m, char *); \ 345 *(buf + i) = out[i]; \ 346 } 347*/ 348 |