ace-dentandBurer
a4f3f3545a
- Move source code from `trunk` into root directory. - Update build files and ASM include paths. Add SPDX license header where appropriate. - These changes also update the CI build files in `.gitea/workflows/`. - Note: Line endings standardised from `CRLF` > `LF`, so best to view diffs with whitespace changes hidden. (Work towards [#75](KolibriOS/kolibrios#75), point 3) --------- Co-authored-by: Burer <burer@kolibrios.org> Reviewed-on: KolibriOS/kolibrios#425 Reviewed-by: Mikhail Frolov <mixa.frolov2003@gmail.com> Reviewed-by: Burer <burer@kolibrios.org> Co-authored-by: Andrew <dent.ace@gmail.com> Co-committed-by: Andrew <dent.ace@gmail.com>
48 lines
1.3 KiB
C
48 lines
1.3 KiB
C
/*********************************************************************
|
|
* Filename: arcfour.c
|
|
* Author: Brad Conte (brad AT bradconte.com)
|
|
* Copyright:
|
|
* Disclaimer: This code is presented "as is" without any guarantees.
|
|
* Details: Implementation of the ARCFOUR encryption algorithm.
|
|
Algorithm specification can be found here:
|
|
* http://en.wikipedia.org/wiki/RC4
|
|
*********************************************************************/
|
|
|
|
/*************************** HEADER FILES ***************************/
|
|
#include <stdlib.h>
|
|
#include <cryptal/arcfour.h>
|
|
|
|
/*********************** FUNCTION DEFINITIONS ***********************/
|
|
void arcfour_key_setup(BYTE state[], const BYTE key[], int len)
|
|
{
|
|
int i, j;
|
|
BYTE t;
|
|
|
|
for (i = 0; i < 256; ++i)
|
|
state[i] = i;
|
|
for (i = 0, j = 0; i < 256; ++i) {
|
|
j = (j + state[i] + key[i % len]) % 256;
|
|
t = state[i];
|
|
state[i] = state[j];
|
|
state[j] = t;
|
|
}
|
|
}
|
|
|
|
// This does not hold state between calls. It always generates the
|
|
// stream starting from the first output byte.
|
|
void arcfour_generate_stream(BYTE state[], BYTE out[], size_t len)
|
|
{
|
|
int i, j;
|
|
size_t idx;
|
|
BYTE t;
|
|
|
|
for (idx = 0, i = 0, j = 0; idx < len; ++idx) {
|
|
i = (i + 1) % 256;
|
|
j = (j + state[i]) % 256;
|
|
t = state[i];
|
|
state[i] = state[j];
|
|
state[j] = t;
|
|
out[idx] = state[(state[i] + state[j]) % 256];
|
|
}
|
|
}
|