mirror of
https://github.com/sle118/squeezelite-esp32.git
synced 2025-12-15 16:07:05 +03:00
new cspot/bell
This commit is contained in:
philippe44
@@ -5,437 +5,389 @@
|
||||
|
||||
using std::size_t;
|
||||
|
||||
static inline uint32_t rotl(uint32_t n, unsigned int c)
|
||||
{
|
||||
const unsigned int mask = (CHAR_BIT * sizeof(n) - 1); // assumes width is a power of 2.
|
||||
// assert ( (c<=mask) &&"rotate by type width or more");
|
||||
c &= mask;
|
||||
return (n << c) | (n >> ((-c) & mask));
|
||||
static inline uint32_t rotl(uint32_t n, unsigned int c) {
|
||||
const unsigned int mask =
|
||||
(CHAR_BIT * sizeof(n) - 1); // assumes width is a power of 2.
|
||||
// assert ( (c<=mask) &&"rotate by type width or more");
|
||||
c &= mask;
|
||||
return (n << c) | (n >> ((-c) & mask));
|
||||
}
|
||||
|
||||
static inline uint32_t rotr(uint32_t n, unsigned int c)
|
||||
{
|
||||
const unsigned int mask = (CHAR_BIT * sizeof(n) - 1); // assumes width is a power of 2.
|
||||
// assert ( (c<=mask) &&"rotate by type width or more");
|
||||
c &= mask;
|
||||
return (n >> c) | (n << ((-c) & mask));
|
||||
static inline uint32_t rotr(uint32_t n, unsigned int c) {
|
||||
const unsigned int mask =
|
||||
(CHAR_BIT * sizeof(n) - 1); // assumes width is a power of 2.
|
||||
// assert ( (c<=mask) &&"rotate by type width or more");
|
||||
c &= mask;
|
||||
return (n >> c) | (n << ((-c) & mask));
|
||||
}
|
||||
|
||||
uint32_t Shannon::sbox1(uint32_t w)
|
||||
{
|
||||
w ^= rotl(w, 5) | rotl(w, 7);
|
||||
w ^= rotl(w, 19) | rotl(w, 22);
|
||||
return w;
|
||||
uint32_t Shannon::sbox1(uint32_t w) {
|
||||
w ^= rotl(w, 5) | rotl(w, 7);
|
||||
w ^= rotl(w, 19) | rotl(w, 22);
|
||||
return w;
|
||||
}
|
||||
|
||||
uint32_t Shannon::sbox2(uint32_t w)
|
||||
{
|
||||
w ^= rotl(w, 7) | rotl(w, 22);
|
||||
w ^= rotl(w, 5) | rotl(w, 19);
|
||||
return w;
|
||||
uint32_t Shannon::sbox2(uint32_t w) {
|
||||
w ^= rotl(w, 7) | rotl(w, 22);
|
||||
w ^= rotl(w, 5) | rotl(w, 19);
|
||||
return w;
|
||||
}
|
||||
|
||||
void Shannon::cycle()
|
||||
{
|
||||
uint32_t t;
|
||||
int i;
|
||||
void Shannon::cycle() {
|
||||
uint32_t t;
|
||||
int i;
|
||||
|
||||
/* nonlinear feedback function */
|
||||
t = this->R[12] ^ this->R[13] ^ this->konst;
|
||||
t = Shannon::sbox1(t) ^ rotl(this->R[0], 1);
|
||||
/* shift register */
|
||||
for (i = 1; i < N; ++i)
|
||||
this->R[i - 1] = this->R[i];
|
||||
this->R[N - 1] = t;
|
||||
t = Shannon::sbox2(this->R[2] ^ this->R[15]);
|
||||
this->R[0] ^= t;
|
||||
this->sbuf = t ^ this->R[8] ^ this->R[12];
|
||||
/* nonlinear feedback function */
|
||||
t = this->R[12] ^ this->R[13] ^ this->konst;
|
||||
t = Shannon::sbox1(t) ^ rotl(this->R[0], 1);
|
||||
/* shift register */
|
||||
for (i = 1; i < N; ++i)
|
||||
this->R[i - 1] = this->R[i];
|
||||
this->R[N - 1] = t;
|
||||
t = Shannon::sbox2(this->R[2] ^ this->R[15]);
|
||||
this->R[0] ^= t;
|
||||
this->sbuf = t ^ this->R[8] ^ this->R[12];
|
||||
}
|
||||
|
||||
void Shannon::crcfunc(uint32_t i)
|
||||
{
|
||||
uint32_t t;
|
||||
int j;
|
||||
void Shannon::crcfunc(uint32_t i) {
|
||||
uint32_t t;
|
||||
int j;
|
||||
|
||||
/* Accumulate CRC of input */
|
||||
t = this->CRC[0] ^ this->CRC[2] ^ this->CRC[15] ^ i;
|
||||
for (j = 1; j < N; ++j)
|
||||
this->CRC[j - 1] = this->CRC[j];
|
||||
this->CRC[N - 1] = t;
|
||||
/* Accumulate CRC of input */
|
||||
t = this->CRC[0] ^ this->CRC[2] ^ this->CRC[15] ^ i;
|
||||
for (j = 1; j < N; ++j)
|
||||
this->CRC[j - 1] = this->CRC[j];
|
||||
this->CRC[N - 1] = t;
|
||||
}
|
||||
|
||||
void Shannon::macfunc(uint32_t i)
|
||||
{
|
||||
this->crcfunc(i);
|
||||
this->R[KEYP] ^= i;
|
||||
void Shannon::macfunc(uint32_t i) {
|
||||
this->crcfunc(i);
|
||||
this->R[KEYP] ^= i;
|
||||
}
|
||||
|
||||
void Shannon::initState()
|
||||
{
|
||||
int i;
|
||||
void Shannon::initState() {
|
||||
int i;
|
||||
|
||||
/* Register initialised to Fibonacci numbers; Counter zeroed. */
|
||||
this->R[0] = 1;
|
||||
this->R[1] = 1;
|
||||
for (i = 2; i < N; ++i)
|
||||
this->R[i] = this->R[i - 1] + this->R[i - 2];
|
||||
this->konst = Shannon::INITKONST;
|
||||
/* Register initialised to Fibonacci numbers; Counter zeroed. */
|
||||
this->R[0] = 1;
|
||||
this->R[1] = 1;
|
||||
for (i = 2; i < N; ++i)
|
||||
this->R[i] = this->R[i - 1] + this->R[i - 2];
|
||||
this->konst = Shannon::INITKONST;
|
||||
}
|
||||
void Shannon::saveState()
|
||||
{
|
||||
int i;
|
||||
for (i = 0; i < Shannon::N; ++i)
|
||||
this->initR[i] = this->R[i];
|
||||
void Shannon::saveState() {
|
||||
int i;
|
||||
for (i = 0; i < Shannon::N; ++i)
|
||||
this->initR[i] = this->R[i];
|
||||
}
|
||||
void Shannon::reloadState()
|
||||
{
|
||||
int i;
|
||||
void Shannon::reloadState() {
|
||||
int i;
|
||||
|
||||
for (i = 0; i < Shannon::N; ++i)
|
||||
this->R[i] = this->initR[i];
|
||||
for (i = 0; i < Shannon::N; ++i)
|
||||
this->R[i] = this->initR[i];
|
||||
}
|
||||
void Shannon::genkonst()
|
||||
{
|
||||
this->konst = this->R[0];
|
||||
void Shannon::genkonst() {
|
||||
this->konst = this->R[0];
|
||||
}
|
||||
void Shannon::diffuse()
|
||||
{
|
||||
int i;
|
||||
void Shannon::diffuse() {
|
||||
int i;
|
||||
|
||||
for (i = 0; i < Shannon::FOLD; ++i)
|
||||
this->cycle();
|
||||
for (i = 0; i < Shannon::FOLD; ++i)
|
||||
this->cycle();
|
||||
}
|
||||
|
||||
#define Byte(x, i) ((uint32_t)(((x) >> (8 * (i))) & 0xFF))
|
||||
#define BYTE2WORD(b) ( \
|
||||
(((uint32_t)(b)[3] & 0xFF) << 24) | \
|
||||
(((uint32_t)(b)[2] & 0xFF) << 16) | \
|
||||
(((uint32_t)(b)[1] & 0xFF) << 8) | \
|
||||
(((uint32_t)(b)[0] & 0xFF)))
|
||||
#define WORD2BYTE(w, b) \
|
||||
{ \
|
||||
(b)[3] = Byte(w, 3); \
|
||||
(b)[2] = Byte(w, 2); \
|
||||
(b)[1] = Byte(w, 1); \
|
||||
(b)[0] = Byte(w, 0); \
|
||||
}
|
||||
#define XORWORD(w, b) \
|
||||
{ \
|
||||
(b)[3] ^= Byte(w, 3); \
|
||||
(b)[2] ^= Byte(w, 2); \
|
||||
(b)[1] ^= Byte(w, 1); \
|
||||
(b)[0] ^= Byte(w, 0); \
|
||||
}
|
||||
#define BYTE2WORD(b) \
|
||||
((((uint32_t)(b)[3] & 0xFF) << 24) | (((uint32_t)(b)[2] & 0xFF) << 16) | \
|
||||
(((uint32_t)(b)[1] & 0xFF) << 8) | (((uint32_t)(b)[0] & 0xFF)))
|
||||
#define WORD2BYTE(w, b) \
|
||||
{ \
|
||||
(b)[3] = Byte(w, 3); \
|
||||
(b)[2] = Byte(w, 2); \
|
||||
(b)[1] = Byte(w, 1); \
|
||||
(b)[0] = Byte(w, 0); \
|
||||
}
|
||||
#define XORWORD(w, b) \
|
||||
{ \
|
||||
(b)[3] ^= Byte(w, 3); \
|
||||
(b)[2] ^= Byte(w, 2); \
|
||||
(b)[1] ^= Byte(w, 1); \
|
||||
(b)[0] ^= Byte(w, 0); \
|
||||
}
|
||||
|
||||
#define XORWORD(w, b) \
|
||||
{ \
|
||||
(b)[3] ^= Byte(w, 3); \
|
||||
(b)[2] ^= Byte(w, 2); \
|
||||
(b)[1] ^= Byte(w, 1); \
|
||||
(b)[0] ^= Byte(w, 0); \
|
||||
}
|
||||
#define XORWORD(w, b) \
|
||||
{ \
|
||||
(b)[3] ^= Byte(w, 3); \
|
||||
(b)[2] ^= Byte(w, 2); \
|
||||
(b)[1] ^= Byte(w, 1); \
|
||||
(b)[0] ^= Byte(w, 0); \
|
||||
}
|
||||
|
||||
/* Load key material into the register
|
||||
*/
|
||||
#define ADDKEY(k) \
|
||||
this->R[KEYP] ^= (k);
|
||||
#define ADDKEY(k) this->R[KEYP] ^= (k);
|
||||
|
||||
void Shannon::loadKey(const std::vector<uint8_t>& key)
|
||||
{
|
||||
int i, j;
|
||||
uint32_t k;
|
||||
uint8_t xtra[4];
|
||||
size_t keylen = key.size();
|
||||
/* start folding in key */
|
||||
for (i = 0; i < (keylen & ~0x3); i += 4)
|
||||
{
|
||||
k = BYTE2WORD(&key[i]);
|
||||
ADDKEY(k);
|
||||
this->cycle();
|
||||
}
|
||||
|
||||
/* if there were any extra key bytes, zero pad to a word */
|
||||
if (i < keylen)
|
||||
{
|
||||
for (j = 0 /* i unchanged */; i < keylen; ++i)
|
||||
xtra[j++] = key[i];
|
||||
for (/* j unchanged */; j < 4; ++j)
|
||||
xtra[j] = 0;
|
||||
k = BYTE2WORD(xtra);
|
||||
ADDKEY(k);
|
||||
this->cycle();
|
||||
}
|
||||
|
||||
/* also fold in the length of the key */
|
||||
ADDKEY(keylen);
|
||||
void Shannon::loadKey(const std::vector<uint8_t>& key) {
|
||||
int i, j;
|
||||
uint32_t k;
|
||||
uint8_t xtra[4];
|
||||
size_t keylen = key.size();
|
||||
/* start folding in key */
|
||||
for (i = 0; i < (keylen & ~0x3); i += 4) {
|
||||
k = BYTE2WORD(&key[i]);
|
||||
ADDKEY(k);
|
||||
this->cycle();
|
||||
}
|
||||
|
||||
/* save a copy of the register */
|
||||
for (i = 0; i < N; ++i)
|
||||
this->CRC[i] = this->R[i];
|
||||
/* if there were any extra key bytes, zero pad to a word */
|
||||
if (i < keylen) {
|
||||
for (j = 0 /* i unchanged */; i < keylen; ++i)
|
||||
xtra[j++] = key[i];
|
||||
for (/* j unchanged */; j < 4; ++j)
|
||||
xtra[j] = 0;
|
||||
k = BYTE2WORD(xtra);
|
||||
ADDKEY(k);
|
||||
this->cycle();
|
||||
}
|
||||
|
||||
/* now diffuse */
|
||||
this->diffuse();
|
||||
/* also fold in the length of the key */
|
||||
ADDKEY(keylen);
|
||||
this->cycle();
|
||||
|
||||
/* now xor the copy back -- makes key loading irreversible */
|
||||
for (i = 0; i < N; ++i)
|
||||
this->R[i] ^= this->CRC[i];
|
||||
/* save a copy of the register */
|
||||
for (i = 0; i < N; ++i)
|
||||
this->CRC[i] = this->R[i];
|
||||
|
||||
/* now diffuse */
|
||||
this->diffuse();
|
||||
|
||||
/* now xor the copy back -- makes key loading irreversible */
|
||||
for (i = 0; i < N; ++i)
|
||||
this->R[i] ^= this->CRC[i];
|
||||
}
|
||||
|
||||
void Shannon::key(const std::vector<uint8_t>& key)
|
||||
{
|
||||
this->initState();
|
||||
this->loadKey(key);
|
||||
this->genkonst(); /* in case we proceed to stream generation */
|
||||
this->saveState();
|
||||
this->nbuf = 0;
|
||||
void Shannon::key(const std::vector<uint8_t>& key) {
|
||||
this->initState();
|
||||
this->loadKey(key);
|
||||
this->genkonst(); /* in case we proceed to stream generation */
|
||||
this->saveState();
|
||||
this->nbuf = 0;
|
||||
}
|
||||
|
||||
void Shannon::nonce(const std::vector<uint8_t>& nonce)
|
||||
{
|
||||
this->reloadState();
|
||||
this->konst = Shannon::INITKONST;
|
||||
this->loadKey(nonce);
|
||||
this->genkonst();
|
||||
this->nbuf = 0;
|
||||
void Shannon::nonce(const std::vector<uint8_t>& nonce) {
|
||||
this->reloadState();
|
||||
this->konst = Shannon::INITKONST;
|
||||
this->loadKey(nonce);
|
||||
this->genkonst();
|
||||
this->nbuf = 0;
|
||||
}
|
||||
|
||||
void Shannon::stream(std::vector<uint8_t>& bufVec)
|
||||
{
|
||||
uint8_t* endbuf;
|
||||
size_t nbytes = bufVec.size();
|
||||
uint8_t* buf = bufVec.data();
|
||||
/* handle any previously buffered bytes */
|
||||
while (this->nbuf != 0 && nbytes != 0)
|
||||
{
|
||||
*buf++ ^= this->sbuf & 0xFF;
|
||||
this->sbuf >>= 8;
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
void Shannon::stream(std::vector<uint8_t>& bufVec) {
|
||||
uint8_t* endbuf;
|
||||
size_t nbytes = bufVec.size();
|
||||
uint8_t* buf = bufVec.data();
|
||||
/* handle any previously buffered bytes */
|
||||
while (this->nbuf != 0 && nbytes != 0) {
|
||||
*buf++ ^= this->sbuf & 0xFF;
|
||||
this->sbuf >>= 8;
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
|
||||
/* handle whole words */
|
||||
endbuf = &buf[nbytes & ~((uint32_t)0x03)];
|
||||
while (buf < endbuf)
|
||||
{
|
||||
this->cycle();
|
||||
XORWORD(this->sbuf, buf);
|
||||
buf += 4;
|
||||
}
|
||||
/* handle whole words */
|
||||
endbuf = &buf[nbytes & ~((uint32_t)0x03)];
|
||||
while (buf < endbuf) {
|
||||
this->cycle();
|
||||
XORWORD(this->sbuf, buf);
|
||||
buf += 4;
|
||||
}
|
||||
|
||||
/* handle any trailing bytes */
|
||||
nbytes &= 0x03;
|
||||
if (nbytes != 0)
|
||||
{
|
||||
this->cycle();
|
||||
this->nbuf = 32;
|
||||
while (this->nbuf != 0 && nbytes != 0)
|
||||
{
|
||||
*buf++ ^= this->sbuf & 0xFF;
|
||||
this->sbuf >>= 8;
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
/* handle any trailing bytes */
|
||||
nbytes &= 0x03;
|
||||
if (nbytes != 0) {
|
||||
this->cycle();
|
||||
this->nbuf = 32;
|
||||
while (this->nbuf != 0 && nbytes != 0) {
|
||||
*buf++ ^= this->sbuf & 0xFF;
|
||||
this->sbuf >>= 8;
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void Shannon::maconly(std::vector<uint8_t>& bufVec)
|
||||
{
|
||||
size_t nbytes = bufVec.size();
|
||||
uint8_t* buf = bufVec.data();
|
||||
void Shannon::maconly(std::vector<uint8_t>& bufVec) {
|
||||
size_t nbytes = bufVec.size();
|
||||
uint8_t* buf = bufVec.data();
|
||||
|
||||
uint8_t* endbuf;
|
||||
uint8_t* endbuf;
|
||||
|
||||
/* handle any previously buffered bytes */
|
||||
if (this->nbuf != 0)
|
||||
{
|
||||
while (this->nbuf != 0 && nbytes != 0)
|
||||
{
|
||||
this->mbuf ^= (*buf++) << (32 - this->nbuf);
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
if (this->nbuf != 0) /* not a whole word yet */
|
||||
return;
|
||||
/* LFSR already cycled */
|
||||
this->macfunc(this->mbuf);
|
||||
/* handle any previously buffered bytes */
|
||||
if (this->nbuf != 0) {
|
||||
while (this->nbuf != 0 && nbytes != 0) {
|
||||
this->mbuf ^= (*buf++) << (32 - this->nbuf);
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
if (this->nbuf != 0) /* not a whole word yet */
|
||||
return;
|
||||
/* LFSR already cycled */
|
||||
this->macfunc(this->mbuf);
|
||||
}
|
||||
|
||||
/* handle whole words */
|
||||
endbuf = &buf[nbytes & ~((uint32_t)0x03)];
|
||||
while (buf < endbuf)
|
||||
{
|
||||
this->cycle();
|
||||
this->macfunc(BYTE2WORD(buf));
|
||||
buf += 4;
|
||||
}
|
||||
/* handle whole words */
|
||||
endbuf = &buf[nbytes & ~((uint32_t)0x03)];
|
||||
while (buf < endbuf) {
|
||||
this->cycle();
|
||||
this->macfunc(BYTE2WORD(buf));
|
||||
buf += 4;
|
||||
}
|
||||
|
||||
/* handle any trailing bytes */
|
||||
nbytes &= 0x03;
|
||||
if (nbytes != 0)
|
||||
{
|
||||
this->cycle();
|
||||
this->mbuf = 0;
|
||||
this->nbuf = 32;
|
||||
while (this->nbuf != 0 && nbytes != 0)
|
||||
{
|
||||
this->mbuf ^= (*buf++) << (32 - this->nbuf);
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
/* handle any trailing bytes */
|
||||
nbytes &= 0x03;
|
||||
if (nbytes != 0) {
|
||||
this->cycle();
|
||||
this->mbuf = 0;
|
||||
this->nbuf = 32;
|
||||
while (this->nbuf != 0 && nbytes != 0) {
|
||||
this->mbuf ^= (*buf++) << (32 - this->nbuf);
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void Shannon::encrypt(std::vector<uint8_t>& bufVec)
|
||||
{
|
||||
size_t nbytes = bufVec.size();
|
||||
uint8_t* buf = bufVec.data();
|
||||
uint8_t* endbuf;
|
||||
uint32_t t = 0;
|
||||
void Shannon::encrypt(std::vector<uint8_t>& bufVec) {
|
||||
size_t nbytes = bufVec.size();
|
||||
uint8_t* buf = bufVec.data();
|
||||
uint8_t* endbuf;
|
||||
uint32_t t = 0;
|
||||
|
||||
/* handle any previously buffered bytes */
|
||||
if (this->nbuf != 0)
|
||||
{
|
||||
while (this->nbuf != 0 && nbytes != 0)
|
||||
{
|
||||
this->mbuf ^= *buf << (32 - this->nbuf);
|
||||
*buf ^= (this->sbuf >> (32 - this->nbuf)) & 0xFF;
|
||||
++buf;
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
if (this->nbuf != 0) /* not a whole word yet */
|
||||
return;
|
||||
/* LFSR already cycled */
|
||||
this->macfunc(this->mbuf);
|
||||
/* handle any previously buffered bytes */
|
||||
if (this->nbuf != 0) {
|
||||
while (this->nbuf != 0 && nbytes != 0) {
|
||||
this->mbuf ^= *buf << (32 - this->nbuf);
|
||||
*buf ^= (this->sbuf >> (32 - this->nbuf)) & 0xFF;
|
||||
++buf;
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
if (this->nbuf != 0) /* not a whole word yet */
|
||||
return;
|
||||
/* LFSR already cycled */
|
||||
this->macfunc(this->mbuf);
|
||||
}
|
||||
|
||||
/* handle whole words */
|
||||
endbuf = &buf[nbytes & ~((uint32_t)0x03)];
|
||||
while (buf < endbuf)
|
||||
{
|
||||
this->cycle();
|
||||
t = BYTE2WORD(buf);
|
||||
this->macfunc(t);
|
||||
t ^= this->sbuf;
|
||||
WORD2BYTE(t, buf);
|
||||
buf += 4;
|
||||
}
|
||||
/* handle whole words */
|
||||
endbuf = &buf[nbytes & ~((uint32_t)0x03)];
|
||||
while (buf < endbuf) {
|
||||
this->cycle();
|
||||
t = BYTE2WORD(buf);
|
||||
this->macfunc(t);
|
||||
t ^= this->sbuf;
|
||||
WORD2BYTE(t, buf);
|
||||
buf += 4;
|
||||
}
|
||||
|
||||
/* handle any trailing bytes */
|
||||
nbytes &= 0x03;
|
||||
if (nbytes != 0)
|
||||
{
|
||||
this->cycle();
|
||||
this->mbuf = 0;
|
||||
this->nbuf = 32;
|
||||
while (this->nbuf != 0 && nbytes != 0)
|
||||
{
|
||||
this->mbuf ^= *buf << (32 - this->nbuf);
|
||||
*buf ^= (this->sbuf >> (32 - this->nbuf)) & 0xFF;
|
||||
++buf;
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
/* handle any trailing bytes */
|
||||
nbytes &= 0x03;
|
||||
if (nbytes != 0) {
|
||||
this->cycle();
|
||||
this->mbuf = 0;
|
||||
this->nbuf = 32;
|
||||
while (this->nbuf != 0 && nbytes != 0) {
|
||||
this->mbuf ^= *buf << (32 - this->nbuf);
|
||||
*buf ^= (this->sbuf >> (32 - this->nbuf)) & 0xFF;
|
||||
++buf;
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void Shannon::decrypt(std::vector<uint8_t>& bufVec) {
|
||||
size_t nbytes = bufVec.size();
|
||||
uint8_t* buf = bufVec.data();
|
||||
uint8_t* endbuf;
|
||||
uint32_t t = 0;
|
||||
|
||||
void Shannon::decrypt(std::vector<uint8_t>& bufVec)
|
||||
{
|
||||
size_t nbytes = bufVec.size();
|
||||
uint8_t* buf = bufVec.data();
|
||||
uint8_t* endbuf;
|
||||
uint32_t t = 0;
|
||||
|
||||
/* handle any previously buffered bytes */
|
||||
if (this->nbuf != 0)
|
||||
{
|
||||
while (this->nbuf != 0 && nbytes != 0)
|
||||
{
|
||||
*buf ^= (this->sbuf >> (32 - this->nbuf)) & 0xFF;
|
||||
this->mbuf ^= *buf << (32 - this->nbuf);
|
||||
++buf;
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
if (this->nbuf != 0) /* not a whole word yet */
|
||||
return;
|
||||
/* LFSR already cycled */
|
||||
this->macfunc(this->mbuf);
|
||||
/* handle any previously buffered bytes */
|
||||
if (this->nbuf != 0) {
|
||||
while (this->nbuf != 0 && nbytes != 0) {
|
||||
*buf ^= (this->sbuf >> (32 - this->nbuf)) & 0xFF;
|
||||
this->mbuf ^= *buf << (32 - this->nbuf);
|
||||
++buf;
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
if (this->nbuf != 0) /* not a whole word yet */
|
||||
return;
|
||||
/* LFSR already cycled */
|
||||
this->macfunc(this->mbuf);
|
||||
}
|
||||
|
||||
/* handle whole words */
|
||||
endbuf = &buf[nbytes & ~((uint32_t)0x03)];
|
||||
while (buf < endbuf)
|
||||
{
|
||||
this->cycle();
|
||||
t = BYTE2WORD(buf) ^ this->sbuf;
|
||||
this->macfunc(t);
|
||||
WORD2BYTE(t, buf);
|
||||
buf += 4;
|
||||
}
|
||||
/* handle whole words */
|
||||
endbuf = &buf[nbytes & ~((uint32_t)0x03)];
|
||||
while (buf < endbuf) {
|
||||
this->cycle();
|
||||
t = BYTE2WORD(buf) ^ this->sbuf;
|
||||
this->macfunc(t);
|
||||
WORD2BYTE(t, buf);
|
||||
buf += 4;
|
||||
}
|
||||
|
||||
/* handle any trailing bytes */
|
||||
nbytes &= 0x03;
|
||||
if (nbytes != 0)
|
||||
{
|
||||
this->cycle();
|
||||
this->mbuf = 0;
|
||||
this->nbuf = 32;
|
||||
while (this->nbuf != 0 && nbytes != 0)
|
||||
{
|
||||
*buf ^= (this->sbuf >> (32 - this->nbuf)) & 0xFF;
|
||||
this->mbuf ^= *buf << (32 - this->nbuf);
|
||||
++buf;
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
/* handle any trailing bytes */
|
||||
nbytes &= 0x03;
|
||||
if (nbytes != 0) {
|
||||
this->cycle();
|
||||
this->mbuf = 0;
|
||||
this->nbuf = 32;
|
||||
while (this->nbuf != 0 && nbytes != 0) {
|
||||
*buf ^= (this->sbuf >> (32 - this->nbuf)) & 0xFF;
|
||||
this->mbuf ^= *buf << (32 - this->nbuf);
|
||||
++buf;
|
||||
this->nbuf -= 8;
|
||||
--nbytes;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void Shannon::finish(std::vector<uint8_t>& bufVec)
|
||||
{
|
||||
size_t nbytes = bufVec.size();
|
||||
uint8_t* buf = bufVec.data();
|
||||
int i;
|
||||
void Shannon::finish(std::vector<uint8_t>& bufVec) {
|
||||
size_t nbytes = bufVec.size();
|
||||
uint8_t* buf = bufVec.data();
|
||||
int i;
|
||||
|
||||
/* handle any previously buffered bytes */
|
||||
if (this->nbuf != 0)
|
||||
{
|
||||
/* LFSR already cycled */
|
||||
this->macfunc(this->mbuf);
|
||||
}
|
||||
/* handle any previously buffered bytes */
|
||||
if (this->nbuf != 0) {
|
||||
/* LFSR already cycled */
|
||||
this->macfunc(this->mbuf);
|
||||
}
|
||||
|
||||
/* perturb the MAC to mark end of input.
|
||||
/* perturb the MAC to mark end of input.
|
||||
* Note that only the stream register is updated, not the CRC. This is an
|
||||
* action that can't be duplicated by passing in plaintext, hence
|
||||
* defeating any kind of extension attack.
|
||||
*/
|
||||
this->cycle();
|
||||
ADDKEY(INITKONST ^ (this->nbuf << 3));
|
||||
this->nbuf = 0;
|
||||
|
||||
/* now add the CRC to the stream register and diffuse it */
|
||||
for (i = 0; i < N; ++i)
|
||||
this->R[i] ^= this->CRC[i];
|
||||
this->diffuse();
|
||||
|
||||
/* produce output from the stream buffer */
|
||||
while (nbytes > 0) {
|
||||
this->cycle();
|
||||
ADDKEY(INITKONST ^ (this->nbuf << 3));
|
||||
this->nbuf = 0;
|
||||
|
||||
/* now add the CRC to the stream register and diffuse it */
|
||||
for (i = 0; i < N; ++i)
|
||||
this->R[i] ^= this->CRC[i];
|
||||
this->diffuse();
|
||||
|
||||
/* produce output from the stream buffer */
|
||||
while (nbytes > 0)
|
||||
{
|
||||
this->cycle();
|
||||
if (nbytes >= 4)
|
||||
{
|
||||
WORD2BYTE(this->sbuf, buf);
|
||||
nbytes -= 4;
|
||||
buf += 4;
|
||||
}
|
||||
else
|
||||
{
|
||||
for (i = 0; i < nbytes; ++i)
|
||||
buf[i] = Byte(this->sbuf, i);
|
||||
break;
|
||||
}
|
||||
if (nbytes >= 4) {
|
||||
WORD2BYTE(this->sbuf, buf);
|
||||
nbytes -= 4;
|
||||
buf += 4;
|
||||
} else {
|
||||
for (i = 0; i < nbytes; ++i)
|
||||
buf[i] = Byte(this->sbuf, i);
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user