diff options
Diffstat (limited to 'src/lib/libcrypto')
| -rw-r--r-- | src/lib/libcrypto/bf/asm/bf-586.pl | 137 | ||||
| -rw-r--r-- | src/lib/libcrypto/bf/bf_cbc.c | 137 |
2 files changed, 0 insertions, 274 deletions
diff --git a/src/lib/libcrypto/bf/asm/bf-586.pl b/src/lib/libcrypto/bf/asm/bf-586.pl deleted file mode 100644 index 1f9b345aee..0000000000 --- a/src/lib/libcrypto/bf/asm/bf-586.pl +++ /dev/null | |||
| @@ -1,137 +0,0 @@ | |||
| 1 | #!/usr/local/bin/perl | ||
| 2 | |||
| 3 | $0 =~ m/(.*[\/\\])[^\/\\]+$/; $dir=$1; | ||
| 4 | push(@INC,"${dir}","${dir}../../perlasm"); | ||
| 5 | require "x86asm.pl"; | ||
| 6 | require "cbc.pl"; | ||
| 7 | |||
| 8 | &asm_init($ARGV[0],"bf-586.pl",$ARGV[$#ARGV] eq "386"); | ||
| 9 | |||
| 10 | $BF_ROUNDS=16; | ||
| 11 | $BF_OFF=($BF_ROUNDS+2)*4; | ||
| 12 | $L="edi"; | ||
| 13 | $R="esi"; | ||
| 14 | $P="ebp"; | ||
| 15 | $tmp1="eax"; | ||
| 16 | $tmp2="ebx"; | ||
| 17 | $tmp3="ecx"; | ||
| 18 | $tmp4="edx"; | ||
| 19 | |||
| 20 | &BF_encrypt("BF_encrypt",1); | ||
| 21 | &BF_encrypt("BF_decrypt",0); | ||
| 22 | &cbc("BF_cbc_encrypt","BF_encrypt","BF_decrypt",1,4,5,3,-1,-1) unless $main'openbsd; | ||
| 23 | &asm_finish(); | ||
| 24 | |||
| 25 | sub BF_encrypt | ||
| 26 | { | ||
| 27 | local($name,$enc)=@_; | ||
| 28 | |||
| 29 | &function_begin_B($name,""); | ||
| 30 | |||
| 31 | &comment(""); | ||
| 32 | |||
| 33 | &push("ebp"); | ||
| 34 | &push("ebx"); | ||
| 35 | &mov($tmp2,&wparam(0)); | ||
| 36 | &mov($P,&wparam(1)); | ||
| 37 | &push("esi"); | ||
| 38 | &push("edi"); | ||
| 39 | |||
| 40 | &comment("Load the 2 words"); | ||
| 41 | &mov($L,&DWP(0,$tmp2,"",0)); | ||
| 42 | &mov($R,&DWP(4,$tmp2,"",0)); | ||
| 43 | |||
| 44 | &xor( $tmp1, $tmp1); | ||
| 45 | |||
| 46 | # encrypting part | ||
| 47 | |||
| 48 | if ($enc) | ||
| 49 | { | ||
| 50 | &mov($tmp2,&DWP(0,$P,"",0)); | ||
| 51 | &xor( $tmp3, $tmp3); | ||
| 52 | |||
| 53 | &xor($L,$tmp2); | ||
| 54 | for ($i=0; $i<$BF_ROUNDS; $i+=2) | ||
| 55 | { | ||
| 56 | &comment(""); | ||
| 57 | &comment("Round $i"); | ||
| 58 | &BF_ENCRYPT($i+1,$R,$L,$P,$tmp1,$tmp2,$tmp3,$tmp4,1); | ||
| 59 | |||
| 60 | &comment(""); | ||
| 61 | &comment("Round ".sprintf("%d",$i+1)); | ||
| 62 | &BF_ENCRYPT($i+2,$L,$R,$P,$tmp1,$tmp2,$tmp3,$tmp4,1); | ||
| 63 | } | ||
| 64 | # &mov($tmp1,&wparam(0)); In last loop | ||
| 65 | &mov($tmp4,&DWP(($BF_ROUNDS+1)*4,$P,"",0)); | ||
| 66 | } | ||
| 67 | else | ||
| 68 | { | ||
| 69 | &mov($tmp2,&DWP(($BF_ROUNDS+1)*4,$P,"",0)); | ||
| 70 | &xor( $tmp3, $tmp3); | ||
| 71 | |||
| 72 | &xor($L,$tmp2); | ||
| 73 | for ($i=$BF_ROUNDS; $i>0; $i-=2) | ||
| 74 | { | ||
| 75 | &comment(""); | ||
| 76 | &comment("Round $i"); | ||
| 77 | &BF_ENCRYPT($i,$R,$L,$P,$tmp1,$tmp2,$tmp3,$tmp4,0); | ||
| 78 | &comment(""); | ||
| 79 | &comment("Round ".sprintf("%d",$i-1)); | ||
| 80 | &BF_ENCRYPT($i-1,$L,$R,$P,$tmp1,$tmp2,$tmp3,$tmp4,0); | ||
| 81 | } | ||
| 82 | # &mov($tmp1,&wparam(0)); In last loop | ||
| 83 | &mov($tmp4,&DWP(0,$P,"",0)); | ||
| 84 | } | ||
| 85 | |||
| 86 | &xor($R,$tmp4); | ||
| 87 | &mov(&DWP(4,$tmp1,"",0),$L); | ||
| 88 | |||
| 89 | &mov(&DWP(0,$tmp1,"",0),$R); | ||
| 90 | &function_end($name); | ||
| 91 | } | ||
| 92 | |||
| 93 | sub BF_ENCRYPT | ||
| 94 | { | ||
| 95 | local($i,$L,$R,$P,$tmp1,$tmp2,$tmp3,$tmp4,$enc)=@_; | ||
| 96 | |||
| 97 | &mov( $tmp4, &DWP(&n2a($i*4),$P,"",0)); # for next round | ||
| 98 | |||
| 99 | &mov( $tmp2, $R); | ||
| 100 | &xor( $L, $tmp4); | ||
| 101 | |||
| 102 | &shr( $tmp2, 16); | ||
| 103 | &mov( $tmp4, $R); | ||
| 104 | |||
| 105 | &movb( &LB($tmp1), &HB($tmp2)); # A | ||
| 106 | &and( $tmp2, 0xff); # B | ||
| 107 | |||
| 108 | &movb( &LB($tmp3), &HB($tmp4)); # C | ||
| 109 | &and( $tmp4, 0xff); # D | ||
| 110 | |||
| 111 | &mov( $tmp1, &DWP(&n2a($BF_OFF+0x0000),$P,$tmp1,4)); | ||
| 112 | &mov( $tmp2, &DWP(&n2a($BF_OFF+0x0400),$P,$tmp2,4)); | ||
| 113 | |||
| 114 | &add( $tmp2, $tmp1); | ||
| 115 | &mov( $tmp1, &DWP(&n2a($BF_OFF+0x0800),$P,$tmp3,4)); | ||
| 116 | |||
| 117 | &xor( $tmp2, $tmp1); | ||
| 118 | &mov( $tmp4, &DWP(&n2a($BF_OFF+0x0C00),$P,$tmp4,4)); | ||
| 119 | |||
| 120 | &add( $tmp2, $tmp4); | ||
| 121 | if (($enc && ($i != 16)) || ((!$enc) && ($i != 1))) | ||
| 122 | { &xor( $tmp1, $tmp1); } | ||
| 123 | else | ||
| 124 | { | ||
| 125 | &comment("Load parameter 0 ($i) enc=$enc"); | ||
| 126 | &mov($tmp1,&wparam(0)); | ||
| 127 | } # In last loop | ||
| 128 | |||
| 129 | &xor( $L, $tmp2); | ||
| 130 | # delay | ||
| 131 | } | ||
| 132 | |||
| 133 | sub n2a | ||
| 134 | { | ||
| 135 | sprintf("%d",$_[0]); | ||
| 136 | } | ||
| 137 | |||
diff --git a/src/lib/libcrypto/bf/bf_cbc.c b/src/lib/libcrypto/bf/bf_cbc.c deleted file mode 100644 index 044bd19ed7..0000000000 --- a/src/lib/libcrypto/bf/bf_cbc.c +++ /dev/null | |||
| @@ -1,137 +0,0 @@ | |||
| 1 | /* $OpenBSD: bf_cbc.c,v 1.8 2022/11/26 16:08:51 tb Exp $ */ | ||
| 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | ||
| 3 | * All rights reserved. | ||
| 4 | * | ||
| 5 | * This package is an SSL implementation written | ||
| 6 | * by Eric Young (eay@cryptsoft.com). | ||
| 7 | * The implementation was written so as to conform with Netscapes SSL. | ||
| 8 | * | ||
| 9 | * This library is free for commercial and non-commercial use as long as | ||
| 10 | * the following conditions are aheared to. The following conditions | ||
| 11 | * apply to all code found in this distribution, be it the RC4, RSA, | ||
| 12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | ||
| 13 | * included with this distribution is covered by the same copyright terms | ||
| 14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | ||
| 15 | * | ||
| 16 | * Copyright remains Eric Young's, and as such any Copyright notices in | ||
| 17 | * the code are not to be removed. | ||
| 18 | * If this package is used in a product, Eric Young should be given attribution | ||
| 19 | * as the author of the parts of the library used. | ||
| 20 | * This can be in the form of a textual message at program startup or | ||
| 21 | * in documentation (online or textual) provided with the package. | ||
| 22 | * | ||
| 23 | * Redistribution and use in source and binary forms, with or without | ||
| 24 | * modification, are permitted provided that the following conditions | ||
| 25 | * are met: | ||
| 26 | * 1. Redistributions of source code must retain the copyright | ||
| 27 | * notice, this list of conditions and the following disclaimer. | ||
| 28 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 29 | * notice, this list of conditions and the following disclaimer in the | ||
| 30 | * documentation and/or other materials provided with the distribution. | ||
| 31 | * 3. All advertising materials mentioning features or use of this software | ||
| 32 | * must display the following acknowledgement: | ||
| 33 | * "This product includes cryptographic software written by | ||
| 34 | * Eric Young (eay@cryptsoft.com)" | ||
| 35 | * The word 'cryptographic' can be left out if the rouines from the library | ||
| 36 | * being used are not cryptographic related :-). | ||
| 37 | * 4. If you include any Windows specific code (or a derivative thereof) from | ||
| 38 | * the apps directory (application code) you must include an acknowledgement: | ||
| 39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | ||
| 40 | * | ||
| 41 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | ||
| 42 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 43 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | ||
| 44 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | ||
| 45 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | ||
| 46 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | ||
| 47 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | ||
| 49 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | ||
| 50 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | ||
| 51 | * SUCH DAMAGE. | ||
| 52 | * | ||
| 53 | * The licence and distribution terms for any publically available version or | ||
| 54 | * derivative of this code cannot be changed. i.e. this code cannot simply be | ||
| 55 | * copied and put under another distribution licence | ||
| 56 | * [including the GNU Public Licence.] | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <openssl/blowfish.h> | ||
| 60 | |||
| 61 | #include "bf_local.h" | ||
| 62 | |||
| 63 | void | ||
| 64 | BF_cbc_encrypt(const unsigned char *in, unsigned char *out, long length, | ||
| 65 | const BF_KEY *schedule, unsigned char *ivec, int encrypt) | ||
| 66 | { | ||
| 67 | BF_LONG tin0, tin1; | ||
| 68 | BF_LONG tout0, tout1, xor0, xor1; | ||
| 69 | long l = length; | ||
| 70 | BF_LONG tin[2]; | ||
| 71 | |||
| 72 | if (encrypt) { | ||
| 73 | n2l(ivec, tout0); | ||
| 74 | n2l(ivec, tout1); | ||
| 75 | ivec -= 8; | ||
| 76 | for (l -= 8; l >= 0; l -= 8) { | ||
| 77 | n2l(in, tin0); | ||
| 78 | n2l(in, tin1); | ||
| 79 | tin0 ^= tout0; | ||
| 80 | tin1 ^= tout1; | ||
| 81 | tin[0] = tin0; | ||
| 82 | tin[1] = tin1; | ||
| 83 | BF_encrypt(tin, schedule); | ||
| 84 | tout0 = tin[0]; | ||
| 85 | tout1 = tin[1]; | ||
| 86 | l2n(tout0, out); | ||
| 87 | l2n(tout1, out); | ||
| 88 | } | ||
| 89 | if (l != -8) { | ||
| 90 | n2ln(in, tin0, tin1, l + 8); | ||
| 91 | tin0 ^= tout0; | ||
| 92 | tin1 ^= tout1; | ||
| 93 | tin[0] = tin0; | ||
| 94 | tin[1] = tin1; | ||
| 95 | BF_encrypt(tin, schedule); | ||
| 96 | tout0 = tin[0]; | ||
| 97 | tout1 = tin[1]; | ||
| 98 | l2n(tout0, out); | ||
| 99 | l2n(tout1, out); | ||
| 100 | } | ||
| 101 | l2n(tout0, ivec); | ||
| 102 | l2n(tout1, ivec); | ||
| 103 | } else { | ||
| 104 | n2l(ivec, xor0); | ||
| 105 | n2l(ivec, xor1); | ||
| 106 | ivec -= 8; | ||
| 107 | for (l -= 8; l >= 0; l -= 8) { | ||
| 108 | n2l(in, tin0); | ||
| 109 | n2l(in, tin1); | ||
| 110 | tin[0] = tin0; | ||
| 111 | tin[1] = tin1; | ||
| 112 | BF_decrypt(tin, schedule); | ||
| 113 | tout0 = tin[0]^xor0; | ||
| 114 | tout1 = tin[1]^xor1; | ||
| 115 | l2n(tout0, out); | ||
| 116 | l2n(tout1, out); | ||
| 117 | xor0 = tin0; | ||
| 118 | xor1 = tin1; | ||
| 119 | } | ||
| 120 | if (l != -8) { | ||
| 121 | n2l(in, tin0); | ||
| 122 | n2l(in, tin1); | ||
| 123 | tin[0] = tin0; | ||
| 124 | tin[1] = tin1; | ||
| 125 | BF_decrypt(tin, schedule); | ||
| 126 | tout0 = tin[0]^xor0; | ||
| 127 | tout1 = tin[1]^xor1; | ||
| 128 | l2nn(tout0, tout1, out, l + 8); | ||
| 129 | xor0 = tin0; | ||
| 130 | xor1 = tin1; | ||
| 131 | } | ||
| 132 | l2n(xor0, ivec); | ||
| 133 | l2n(xor1, ivec); | ||
| 134 | } | ||
| 135 | tin0 = tin1 = tout0 = tout1 = xor0 = xor1 = 0; | ||
| 136 | tin[0] = tin[1] = 0; | ||
| 137 | } | ||
