From 253446c20b5aa03014fd04bcb21e6fd607a3ac5a Mon Sep 17 00:00:00 2001 From: David Monniaux Date: Mon, 28 Jan 2019 22:10:50 +0100 Subject: crypto algorithms from https://github.com/B-Con/crypto-algorithms/ --- test/monniaux/crypto-algorithms/rot-13.c | 35 ++++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 test/monniaux/crypto-algorithms/rot-13.c (limited to 'test/monniaux/crypto-algorithms/rot-13.c') diff --git a/test/monniaux/crypto-algorithms/rot-13.c b/test/monniaux/crypto-algorithms/rot-13.c new file mode 100644 index 00000000..0ab84975 --- /dev/null +++ b/test/monniaux/crypto-algorithms/rot-13.c @@ -0,0 +1,35 @@ +/********************************************************************* +* Filename: rot-13.c +* Author: Brad Conte (brad AT bradconte.com) +* Copyright: +* Disclaimer: This code is presented "as is" without any guarantees. +* Details: Implementation of the ROT-13 encryption algorithm. + Algorithm specification can be found here: + * + This implementation uses little endian byte order. +*********************************************************************/ + +/*************************** HEADER FILES ***************************/ +#include +#include "rot-13.h" + +/*********************** FUNCTION DEFINITIONS ***********************/ +void rot13(char str[]) +{ + int case_type, idx, len; + + for (idx = 0, len = strlen(str); idx < len; idx++) { + // Only process alphabetic characters. + if (str[idx] < 'A' || (str[idx] > 'Z' && str[idx] < 'a') || str[idx] > 'z') + continue; + // Determine if the char is upper or lower case. + if (str[idx] >= 'a') + case_type = 'a'; + else + case_type = 'A'; + // Rotate the char's value, ensuring it doesn't accidentally "fall off" the end. + str[idx] = (str[idx] + 13) % (case_type + 26); + if (str[idx] < 26) + str[idx] += case_type; + } +} -- cgit