wring_twistree/

lib.rs

#![allow(arithmetic_overflow)]
//! Wring is a whole-message cipher and Twistree is a hash function.
//! They use the same key space; keys may be up to 96 bytes long
//! (they can be arbitrarily long, but longer keys can be susceptible
//! to related-key attacks). The user-facing modules are `wring` and
//! `twistree`; the others are internals.

// Used by both wring and twistree
mod mix3;
mod rotbitcount;
mod permute;
mod keyschedule;
mod sboxes;

// Used by twistree
mod blockize;
mod compress; // uses mix3 and rotbitcount

pub mod wring {
//! Wring is a whole-message cipher. All the user interface is in the
//! `Wring` class.

use crate::mix3::*;
use crate::rotbitcount::*;
use crate::sboxes::*; // uses keyschedule and permute
pub use crate::mix3::carmichael;

fn n_rounds(n: usize) -> u32 {
  let mut ret=3;
  let mut m=n;
  while m>=2 {
    m/=2;
    ret+=1;
  }
  ret
}

/// Exclusive-ors all bytes in a nonnegative number. The only reason this
/// function is public is that it's used to generate a long bytestring
/// for a test.
pub fn xorn(n: u64) -> u8 { // used for big hash test
  let mut ret=0u8;
  let mut i=n;
  while i>0 {
    ret ^= i as u8;
    i = i>>8;
  }
  ret
}

#[derive(Clone)]
pub struct Wring {
  sbox: [[u8; 256]; 3],
  inv_sbox: [[u8; 256]; 3],
}

impl Wring {
  /// Creates a new unkeyed Wring.
  pub fn new() -> Wring {
    Wring { sbox: NULLKEY, inv_sbox: [[0u8; 256]; 3] }
  }

  fn set_inv_sbox(&mut self) {
    for i in 0..3 {
      for j in 0..256 {
	self.inv_sbox[i][self.sbox[i][j] as usize]=j as u8;
      }
    }
  }

  /// Sets the S-boxes to linear. Use only for testing.
  pub fn set_key_linear(&mut self) {
    for i in 0..3 {
      for j in 0..256 {
	self.sbox[i][j]=(j as u8).rotate_left((3*i+1) as u32);
      }
    }
    self.set_inv_sbox();
  }

  /// Sets the key to a bytestring. Use `.as_bytes` if you have a character string.
  pub fn set_key(&mut self,str:&[u8]) {
    sboxes(str,&mut self.sbox);
    self.set_inv_sbox();
  }

  fn round_encrypt(&self, src: &mut[u8], dst: &mut[u8], rprime: usize, rond: u32) {
    assert_eq!(src.len(),dst.len());
    let len=src.len()/3;
    mix3parts(src,len,rprime); // this clobbers src
    for i in 0..src.len() {
      src[i]=self.sbox[((rond as usize)+i)%3][src[i] as usize];
    }
    rot_bitcount(src, dst, 1);
    for i in 0..dst.len() {
      dst[i]+=xorn((i^(rond as usize)) as u64);
    }
  }

  fn round_decrypt(&self, src: &mut[u8], dst: &mut[u8], rprime: usize, rond: u32) {
    assert_eq!(src.len(),dst.len());
    let len=src.len()/3;
    for i in 0..src.len() { // this clobbers src
      src[i]-=xorn((i^(rond as usize)) as u64);
    }
    rot_bitcount(src, dst, -1);
    for i in 0..dst.len() {
      dst[i]=self.inv_sbox[((rond as usize)+i)%3][dst[i] as usize];
    }
    mix3parts(dst,len,rprime);
  }

  /// Encrypts `buf` in place, using a temporary buffer of equal size.
  pub fn encrypt(&self, buf: &mut[u8]) {
    let mut tmp:Vec<u8> = Vec::new();
    tmp.extend_from_slice(buf);
    let nrond=n_rounds(buf.len());
    let rprime=if buf.len()<3 {
      1 // in Haskell, laziness takes care of this
    } else {
      find_max_order((buf.len()/3) as u64)
    } as usize;
    for i in 0..nrond {
      if (i&1)==0 {
	self.round_encrypt(buf,&mut tmp,rprime,i);
      } else {
	self.round_encrypt(&mut tmp,buf,rprime,i);
      }
    }
    if (nrond&1)>0 {
      for i in 0..buf.len() {
	buf[i]=tmp[i];
      }
    }
  }

  /// Decrypts `buf` in place, using a temporary buffer of equal size.
  pub fn decrypt(&mut self, buf: &mut[u8]) {
    let mut tmp:Vec<u8> = Vec::new();
    tmp.extend_from_slice(buf);
    if self.inv_sbox[0][0]==self.inv_sbox[0][1] {
      self.set_inv_sbox();
    }
    let nrond=n_rounds(buf.len());
    let rprime=if buf.len()<3 {
      1 // in Haskell, laziness takes care of this
    } else {
      find_max_order((buf.len()/3) as u64)
    } as usize;
    for i in (0..nrond).rev() {
      if ((nrond-i)&1)==1 {
	self.round_decrypt(buf,&mut tmp,rprime,i);
      } else {
	self.round_decrypt(&mut tmp,buf,rprime,i);
      }
    }
    if (nrond&1)>0 {
      for i in 0..buf.len() {
	buf[i]=tmp[i];
      }
    }
  }
}

#[cfg(test)]
mod tests {
  use super::*;

  fn test_vector(wring: &Wring, plain: &[u8], cipher: &[u8]) {
    let mut buf:Vec<u8> = Vec::new();
    buf.extend_from_slice(&plain);
    wring.encrypt(&mut buf);
    assert_eq!(&buf,&cipher);
  }

  fn test_new(plain: &[u8]) {
    let mut wring=Wring::new();
    let mut dewring=Wring::new();
    let mut buf:Vec<u8> = Vec::new();
    wring.set_key(&[]);
    buf.extend_from_slice(&plain);
    wring.encrypt(&mut buf);
    dewring.decrypt(&mut buf);
    assert_eq!(&buf,&plain);
  }

  #[test]
  fn test_vectors() {
    let zero8=[0u8; 8];
    let ff8=[255u8; 8];
    let twistree8="Twistree".as_bytes();
    let zero9=[0u8; 9];
    let ff9=[255u8; 9];
    let allornone9="AllOrNone".as_bytes();
    let encipher15="EncipherMessage".as_bytes();
    let mut linear_wring=Wring::new();
    linear_wring.set_key_linear();
    let mut empty_wring=Wring::new();
    empty_wring.set_key(&[]);
    let mut aerate_wring=Wring::new();
    aerate_wring.set_key("aerate".as_bytes());
    let mut χαίρετε_wring=Wring::new();
    χαίρετε_wring.set_key("Πάντοτε χαίρετε!".as_bytes());
    let mut двор_wring=Wring::new();
    let двор_key="Водворетраванатраведрова.Нерубидрованатраведвора!";
    двор_wring.set_key(двор_key.as_bytes());
    test_vector(&linear_wring,&zero8,&[0x5e,0x09,0xc0,0x54,0x3c,0x82,0xdc,0xe8]);
    test_vector(&linear_wring,&ff8,&[0x69,0x9d,0x9d,0xff,0xbc,0x22,0x8a,0x5d]);
    test_vector(&linear_wring,&twistree8,&[0xbb,0xc3,0x28,0x40,0x8c,0x94,0xae,0xf8]);
    test_vector(&linear_wring,&zero9,&[0x4a,0xb1,0x99,0x07,0x1b,0x8c,0xd4,0x54,0xaf]);
    test_vector(&linear_wring,&ff9,&[0x8b,0x6c,0x0a,0x7d,0x32,0x23,0xee,0xc5,0x7f]);
    test_vector(&linear_wring,&allornone9,&[0xc1,0xd8,0x4e,0x09,0xea,0x44,0xf3,0x0d,0x19]);
    test_vector(&linear_wring,&encipher15,
       &[ 0xc5, 0x0e, 0xc1, 0x88, 0xfd, 0x97, 0x89, 0x2d
	, 0xa3, 0xdf, 0x58, 0x15, 0xd3, 0xf4, 0x8c]);
    test_vector(&empty_wring,&zero8,&[0x61,0x4b,0xf3,0x34,0x9e,0x21,0xd1,0x21]);
    test_vector(&empty_wring,&ff8,&[0x22,0xc3,0x6c,0x9f,0xe4,0x27,0xbc,0xce]);
    test_vector(&empty_wring,&twistree8,&[0x9a,0xcd,0xf5,0xe0,0xb0,0x3c,0x0c,0x32]);
    test_vector(&empty_wring,&zero9,&[0x72,0x4d,0x2a,0x49,0xc9,0xb3,0x00,0xdb,0x32]);
    test_vector(&empty_wring,&ff9,&[0xbc,0x05,0xcf,0x4b,0x0f,0x31,0x81,0xba,0x5c]);
    test_vector(&empty_wring,&allornone9,&[0x06,0x15,0xaf,0x81,0x8b,0x63,0x9c,0xa2,0x9e]);
    test_vector(&empty_wring,&encipher15,
       &[ 0x29, 0xb5, 0x8f, 0xd1, 0x67, 0xa7, 0xb3, 0xf6
	, 0x99, 0x33, 0xa8, 0x47, 0x3c, 0xb4, 0xcf]);
    test_vector(&aerate_wring,&zero8,&[0x7d,0x9b,0x65,0x67,0xe8,0xa3,0xd2,0x7d]);
    test_vector(&aerate_wring,&ff8,&[0x2d,0xdc,0xb9,0xb7,0xaa,0x88,0xa2,0xcf]);
    test_vector(&aerate_wring,&twistree8,&[0xc8,0xbc,0x27,0x92,0x7a,0x8d,0x96,0x97]);
    test_vector(&aerate_wring,&zero9,&[0xbe,0x74,0x4a,0x6c,0x6b,0x5b,0x2a,0x6c,0x4e]);
    test_vector(&aerate_wring,&ff9,&[0xb3,0xb5,0xf1,0x9d,0x44,0xa3,0x19,0xd0,0x10]);
    test_vector(&aerate_wring,&allornone9,&[0xe8,0x23,0xcd,0x4d,0x80,0x5f,0xdb,0xb4,0x0a]);
    test_vector(&aerate_wring,&encipher15,
       &[ 0x17, 0x95, 0x06, 0x84, 0x85, 0x6c, 0x0e, 0xed
	, 0x68, 0x70, 0xe4, 0xdd, 0xeb, 0xd1, 0x92]);
    test_vector(&χαίρετε_wring,&zero8,&[0xa3,0x5d,0x2e,0x41,0xf3,0x20,0x9e,0x5c]);
    test_vector(&χαίρετε_wring,&ff8,&[0xbf,0xab,0x12,0xd1,0xa4,0xa7,0x59,0x24]);
    test_vector(&χαίρετε_wring,&twistree8,&[0xf1,0x45,0xbe,0x34,0x3e,0x0e,0x50,0x44]);
    test_vector(&χαίρετε_wring,&zero9,&[0x29,0x37,0x34,0x65,0xb4,0xe3,0xd6,0x8b,0x08]);
    test_vector(&χαίρετε_wring,&ff9,&[0xb9,0x31,0xfb,0xd0,0x08,0x42,0x24,0xe0,0x54]);
    test_vector(&χαίρετε_wring,&allornone9,&[0xa3,0xab,0x75,0x4b,0xea,0x16,0x54,0xd6,0xa7]);
    test_vector(&χαίρετε_wring,&encipher15,
       &[ 0x9b, 0x21, 0x52, 0x31, 0x35, 0x7c, 0xb4, 0x51
	, 0x85, 0x6d, 0xbd, 0x1b, 0xf0, 0xf6, 0x4d]);
    test_vector(&двор_wring,&zero8,&[0xb3,0x8c,0xb4,0x4e,0x32,0xef,0xd7,0xc8]);
    test_vector(&двор_wring,&ff8,&[0x8d,0x0d,0x3c,0x89,0x73,0x22,0xe6,0x6b]);
    test_vector(&двор_wring,&twistree8,&[0xb7,0x00,0x83,0x84,0x41,0x4d,0x14,0x4b]);
    test_vector(&двор_wring,&zero9,&[0x84,0xfb,0x3e,0x5b,0x4f,0xce,0x43,0x54,0x84]);
    test_vector(&двор_wring,&ff9,&[0xed,0xa7,0x7a,0x91,0x3e,0x47,0xa4,0x1e,0x50]);
    test_vector(&двор_wring,&allornone9,&[0x21,0x15,0x76,0xbc,0x8b,0x29,0x18,0x92,0x21]);
    test_vector(&двор_wring,&encipher15,
       &[ 0x5d, 0x6d, 0x0c, 0xa5, 0xfb, 0x0d, 0x38, 0x74
	, 0x6b, 0xd0, 0x41, 0x10, 0x80, 0xf3, 0x78]);
    test_vector(&двор_wring,&двор_key.as_bytes(),
       &[ 0x45, 0x34, 0xac, 0xc5, 0xda, 0x60, 0xe1, 0x0f
        , 0xbf, 0x17, 0x5d, 0xc7, 0x4c, 0xfc, 0x96, 0xe2
        , 0xe9, 0x7a, 0x49, 0x58, 0x38, 0x74, 0x0f, 0x30
        , 0x42, 0x30, 0xcc, 0x39, 0x96, 0x2b, 0x1e, 0xd8
        , 0x1c, 0x82, 0x76, 0x82, 0x65, 0x09, 0xb3, 0xd8
        , 0x31, 0xa6, 0xd2, 0xec, 0x36, 0xdd, 0x80, 0x8a
        , 0x7b, 0x24, 0x56, 0x3e, 0x37, 0xe7, 0x20, 0x68
        , 0x45, 0x1f, 0x15, 0xa8, 0xf2, 0x17, 0xb3, 0xd5
        , 0x78, 0x48, 0xef, 0xc5, 0x73, 0xa6, 0x5c, 0x3c
        , 0x07, 0x11, 0xe2, 0x76, 0xc0, 0xeb, 0xc3, 0xf1
        , 0x96, 0x24, 0xb4, 0x8e, 0xdf, 0x94, 0xba, 0x4d
        , 0x67, 0x2f, 0xc5, 0x6f, 0x4a, 0x5d, 0x85, 0x7e
        ]);
  }

  #[test]
  fn test_unkeyed() {
    test_new("Πάντοτε χαίρετε!".as_bytes());
  }

}

}

pub mod twistree {
//! Twistree is a keyed hash function. All the user interface is in
//! the `Twistree` class.

use crate::sboxes::*; // uses keyschedule and permute
use crate::blockize::*;
use crate::compress::*; // uses mix3 and rot_bitcount


#[derive(Clone)]
pub struct Twistree {
  sbox: [[u8; 256]; 3],
  tree2: Vec<Vec<u8>>,
  tree3: Vec<Vec<u8>>,
  partial_block: Vec<u8>,
}

impl Twistree {
  /// Creates a new unkeyed Twistree.
  pub fn new() -> Twistree {
    Twistree { sbox: NULLKEY,
	       tree2: Vec::new(),
	       tree3: Vec::new(),
	       partial_block: Vec::new() }
  }

  /// Sets the S-box to linear. Use only for testing.
  pub fn set_key_linear(&mut self) {
    for i in 0..3 {
      for j in 0..256 {
	self.sbox[i][j]=(j as u8).rotate_left((3*i+1) as u32);
      }
    }
  }

  /// Sets the key to a bytestring. Use `.as_bytes` if you have a character string.
  pub fn set_key(&mut self,str:&[u8]) {
    sboxes(str,&mut self.sbox);
  }

  /// Initializes a Twistree. Do this before calling `update!` and `finalize!`.
  pub fn initialize(&mut self) {
    // Check that the Twistree has been keyed
    let mut sum:u32=0;
    for i in 0..3 {
      for j in 0..256 {
	sum+=self.sbox[i][j] as u32;
      }
    }
    if sum!=3*255*128 {
      panic!("call set_key before initialize");
    }
    // Check that the Twistree is empty
    if self.tree2.len()>0 || self.tree3.len()>0 || self.partial_block.len()>0 {
      panic!("call finalize before calling initialize again");
    }
    self.tree2.push(Vec::new());
    self.tree3.push(Vec::new());
    self.tree2[0].extend_from_slice(&EXP4_2ADIC[..]);
    self.tree3[0].extend_from_slice(&EXP4_BASE2[..]);
  }

  fn compress_pairs_triples(&mut self) {
    let mut i:usize=0;
    while self.tree2[i].len()>BLOCKSIZE {
      if i+1==self.tree2.len() {
	self.tree2.push(Vec::new());
      }
      compress(&self.sbox,&mut self.tree2[i],0);
      let (extend_from, to_extend) = self.tree2[i..(i+2)].split_at_mut(1);
      to_extend[0].extend_from_slice(&*extend_from[0]);
      self.tree2[i].clear();
      i=i+1;
    }
    i=0;
    while self.tree3[i].len()>2*BLOCKSIZE {
      if i+1==self.tree3.len() {
	self.tree3.push(Vec::new());
      }
      compress(&self.sbox,&mut self.tree3[i],1);
      let (extend_from, to_extend) = self.tree3[i..(i+2)].split_at_mut(1);
      to_extend[0].extend_from_slice(&*extend_from[0]);
      self.tree3[i].clear();
      i=i+1;
    }
  }

  fn finalize_pairs_triples(&mut self) {
    for i in 0..self.tree2.len() {
      compress(&self.sbox,&mut self.tree2[i],0);
      if i+1<self.tree2.len() {
	let (extend_from, to_extend) = self.tree2[i..(i+2)].split_at_mut(1);
	to_extend[0].extend_from_slice(&*extend_from[0]);
	self.tree2[i].clear();
      }
    }
    for i in 0..self.tree3.len() {
      compress(&self.sbox,&mut self.tree3[i],1);
      if i+1<self.tree3.len() {
	let (extend_from, to_extend) = self.tree3[i..(i+2)].split_at_mut(1);
	to_extend[0].extend_from_slice(&*extend_from[0]);
	self.tree3[i].clear();
      }
    }
  }

  /// Updates a Twistree with some data.
  pub fn update(&mut self,data:&[u8]) {
    // Check that the Twistree has been initialized
    if self.tree2.len()==0 || self.tree3.len()==0 {
      panic!("call initialize before update");
    }
    let blocks=blockize(data,&mut self.partial_block);
    for i in 0..blocks.len() {
      self.tree2[0].extend(&blocks[i]);
      self.tree3[0].extend(&blocks[i]);
      self.compress_pairs_triples();
    }
  }

  /// Completes processing the data in the Twistree and returns the hash.
  /// Use after `initialize!` and `update!`.
  pub fn finalize(&mut self) -> Vec<u8> {
    // Check that the Twistree has been initialized
    if self.tree2.len()==0 || self.tree3.len()==0 {
      panic!("call initialize before finalize");
    }
    let last_block=pad(&mut self.partial_block);
    self.tree2[0].extend(&last_block);
    self.tree3[0].extend(&last_block);
    self.compress_pairs_triples();
    self.finalize_pairs_triples();
    let mut fruit=self.tree2.swap_remove(self.tree2.len()-1);
    fruit.extend(self.tree3.swap_remove(self.tree3.len()-1));
    self.tree2.clear();
    self.tree3.clear();
    compress(&self.sbox,&mut fruit,2);
    fruit
  }

  /// convenience function if the data all fit in RAM
  pub fn hash(&mut self,data:&[u8]) -> Vec<u8> {
    self.initialize();
    self.update(data);
    self.finalize()
  }
}

#[cfg(test)]
mod tests {
  use super::*;
  use crate::wring::xorn;

  fn test_vector(twistree: &mut Twistree, plain: &[u8], hash: &[u8]) {
    let mut buf:Vec<u8> = Vec::new();
    buf.extend_from_slice(&plain);
    twistree.initialize();
    twistree.update(&buf);
    let hish=twistree.finalize();
    assert_eq!(&hish,&hash);
  }

  #[test]
  fn test_vectors() {
    let text31="בראשית ברא אלהים ".as_bytes();
    let text33="árvíztűrő tükörfúrógépek".as_bytes();
    let text96="Водворетраванатраведрова.Нерубидрованатраведвора!".as_bytes();
    let mut text59049=[0u8;59049];
    // This long test vector is intended for testing parallel implementations.
    for i in 0..59049 {
      text59049[i]=xorn((i+1) as u64);
    }
    let mut linear_twistree=Twistree::new();
    linear_twistree.set_key_linear();
    let mut empty_twistree=Twistree::new();
    empty_twistree.set_key(&[]);
    let mut aerate_twistree=Twistree::new();
    aerate_twistree.set_key("aerate".as_bytes());
    let mut χαίρετε_twistree=Twistree::new();
    χαίρετε_twistree.set_key("Πάντοτε χαίρετε!".as_bytes());
    let mut двор_twistree=Twistree::new();
    двор_twistree.set_key("Водворетраванатраведрова.Нерубидрованатраведвора!".as_bytes());
    test_vector(&mut linear_twistree,&[],&
      [ 0x51, 0xce, 0xe6, 0x7e, 0xbc, 0x77, 0xf0, 0xc8
      , 0xab, 0xa4, 0x8c, 0x39, 0x9a, 0x33, 0x46, 0xe7 
      , 0xe2, 0x1e, 0xc9, 0xc1, 0x39, 0x8f, 0xdb, 0x99
      , 0xb2, 0x9c, 0x41, 0x37, 0xd0, 0xd7, 0x53, 0xc2
      ]);
    test_vector(&mut linear_twistree,&text31,&
      [ 0x20, 0x8d, 0x61, 0x88, 0x7c, 0x13, 0x27, 0x9f
      , 0x41, 0x26, 0x48, 0x31, 0x5e, 0x64, 0x2b, 0x0e 
      , 0xb1, 0xf1, 0xb6, 0xd2, 0xf9, 0x8f, 0x20, 0x29
      , 0x15, 0xf7, 0xf1, 0xe2, 0x31, 0xf3, 0x74, 0x18
      ]);
    test_vector(&mut linear_twistree,&text33,&
      [ 0x61, 0x6b, 0x91, 0xe4, 0x6f, 0xab, 0x4c, 0x69
      , 0x03, 0xea, 0x9f, 0x2b, 0xc0, 0x0e, 0x90, 0xa2 
      , 0xe4, 0x40, 0xc3, 0x87, 0x1c, 0xa2, 0x27, 0x5a
      , 0x12, 0x10, 0x59, 0x4d, 0x8b, 0x33, 0x7f, 0x9e
      ]);
    test_vector(&mut linear_twistree,&text96,&
      [ 0x34, 0x82, 0x7e, 0xbe, 0x74, 0x06, 0x8e, 0xe1
      , 0xe7, 0x37, 0xaf, 0x31, 0x93, 0x2c, 0xd1, 0x85 
      , 0x35, 0x8c, 0x32, 0x1c, 0x0c, 0xc1, 0xda, 0x47
      , 0x97, 0x57, 0x18, 0xca, 0x57, 0xe3, 0xc8, 0xf8
      ]);
    test_vector(&mut empty_twistree,&[],&
      [ 0x5b, 0x62, 0x5d, 0xeb, 0x4f, 0xa6, 0x92, 0xae
      , 0x56, 0xf9, 0xba, 0x20, 0xf6, 0xb4, 0xc1, 0x05 
      , 0xff, 0x92, 0x92, 0x3c, 0x7e, 0x84, 0xee, 0x2f
      , 0x83, 0xc1, 0x0d, 0xc2, 0x8f, 0xda, 0xa3, 0x7b
      ]);
    test_vector(&mut empty_twistree,&text31,&
      [ 0x4c, 0xc9, 0x2e, 0x58, 0xf2, 0x80, 0xaf, 0x58
      , 0x3e, 0x39, 0x6f, 0x3a, 0x9b, 0x7a, 0xdb, 0x59 
      , 0x65, 0x63, 0xb1, 0x28, 0x96, 0x68, 0x29, 0x83
      , 0xe4, 0x38, 0x1f, 0x79, 0x62, 0x78, 0x44, 0x0b
      ]);
    test_vector(&mut empty_twistree,&text33,&
      [ 0x3b, 0x8c, 0x2e, 0x6d, 0x7a, 0x29, 0x0a, 0x84
      , 0xf4, 0x40, 0xe8, 0x37, 0xc9, 0xd5, 0x8c, 0x64 
      , 0x11, 0x2a, 0x42, 0x17, 0x92, 0xd3, 0x33, 0xa0
      , 0x24, 0xbe, 0xa3, 0x3f, 0x4a, 0x4b, 0x18, 0x1f
      ]);
    test_vector(&mut empty_twistree,&text96,&
      [ 0x4c, 0x19, 0x30, 0x4a, 0xae, 0x2a, 0x92, 0xba
      , 0x9c, 0x05, 0x69, 0x37, 0xd7, 0xfc, 0x36, 0x2d 
      , 0x29, 0x94, 0x8e, 0xdc, 0x3c, 0x56, 0x4f, 0x50
      , 0x08, 0xa7, 0x5b, 0x0a, 0x06, 0x95, 0x90, 0xee
      ]);
    test_vector(&mut aerate_twistree,&[],&
      [ 0x0a, 0x4b, 0x98, 0x44, 0x15, 0xe7, 0x8b, 0xe2
      , 0xfe, 0xba, 0xf5, 0xe5, 0x51, 0x46, 0xe0, 0x05 
      , 0xc8, 0x0c, 0x13, 0x6b, 0xfb, 0x2f, 0x6f, 0xa4
      , 0xf6, 0x08, 0xbb, 0xa6, 0xe9, 0xf3, 0x35, 0xda
      ]);
    test_vector(&mut aerate_twistree,&text31,&
      [ 0x73, 0xd6, 0xe9, 0xc0, 0x63, 0xd5, 0x3c, 0xec
      , 0x4d, 0xd8, 0x3f, 0x89, 0x9f, 0x15, 0xf3, 0xf8 
      , 0xe6, 0x7e, 0xfb, 0xc5, 0x46, 0x4e, 0x11, 0x60
      , 0x9c, 0x0b, 0x75, 0xed, 0x35, 0x23, 0x56, 0x60
      ]);
    test_vector(&mut aerate_twistree,&text33,&
      [ 0x77, 0x0b, 0xe3, 0xbe, 0xc4, 0x9c, 0xf9, 0xd0
      , 0xd1, 0x46, 0xda, 0x03, 0xea, 0xe5, 0x60, 0x4e 
      , 0x47, 0xec, 0xf1, 0x54, 0xe8, 0x6b, 0x63, 0x93
      , 0x59, 0x52, 0xf0, 0x95, 0xb7, 0x32, 0x64, 0x0f
      ]);
    test_vector(&mut aerate_twistree,&text96,&
      [ 0x00, 0x0a, 0x4c, 0x5e, 0x61, 0xd8, 0xb0, 0x14
      , 0xfc, 0xe6, 0x46, 0xf9, 0xd3, 0x0f, 0xb2, 0x71 
      , 0x43, 0x8c, 0xc4, 0x3f, 0x7f, 0x72, 0x0a, 0xfe
      , 0xe1, 0xa3, 0xff, 0xd9, 0x5d, 0xe1, 0x65, 0x76
      ]);
    test_vector(&mut χαίρετε_twistree,&[],&
      [ 0x33, 0x69, 0xba, 0x2b, 0x72, 0x58, 0x6a, 0x78
      , 0x6f, 0xc5, 0xd7, 0xbe, 0x3c, 0x80, 0xac, 0x24 
      , 0x87, 0xb8, 0x6e, 0x2e, 0x1c, 0x4f, 0xee, 0x76
      , 0x71, 0x49, 0x51, 0x7c, 0x58, 0xfb, 0x2e, 0x5a
      ]);
    test_vector(&mut χαίρετε_twistree,&text31,&
      [ 0xef, 0x78, 0x8f, 0x13, 0xb6, 0xb7, 0xd7, 0x9c
      , 0xae, 0xce, 0xbe, 0x56, 0x80, 0x14, 0x4a, 0x37 
      , 0x49, 0x26, 0xd6, 0x88, 0x69, 0x3e, 0x66, 0xd1
      , 0xc6, 0xeb, 0x82, 0x37, 0x57, 0x53, 0xe1, 0x13
      ]);
    test_vector(&mut χαίρετε_twistree,&text33,&
      [ 0xf5, 0xde, 0x17, 0xa3, 0xc6, 0xde, 0x7e, 0x4f
      , 0x17, 0xf6, 0xef, 0x3a, 0xe5, 0x7b, 0x1e, 0xc3 
      , 0xa4, 0x9d, 0x9c, 0x7d, 0x85, 0x42, 0xf4, 0xb3
      , 0xd4, 0x85, 0x94, 0x4d, 0x73, 0x98, 0x79, 0x80
      ]);
    test_vector(&mut χαίρετε_twistree,&text96,&
      [ 0x51, 0x35, 0x1a, 0xb4, 0x7b, 0x42, 0x96, 0xab
      , 0x8c, 0xcd, 0xb7, 0xca, 0x12, 0x1b, 0xe2, 0x26 
      , 0x73, 0x0e, 0x43, 0xd4, 0x42, 0x70, 0xd6, 0x93
      , 0x0c, 0xee, 0xe2, 0xfe, 0x87, 0x88, 0x26, 0xee
      ]);
    test_vector(&mut двор_twistree,&[],&
      [ 0x4e, 0xfa, 0x85, 0x3a, 0xa1, 0xd2, 0x57, 0x43
      , 0x87, 0x44, 0xf4, 0x37, 0x6d, 0x11, 0x40, 0x73 
      , 0x38, 0x22, 0xc8, 0xd2, 0x2f, 0x0b, 0xb1, 0xba
      , 0x06, 0x3b, 0x8e, 0x55, 0x54, 0x70, 0x76, 0x4c
      ]);
    test_vector(&mut двор_twistree,&text31,&
      [ 0xf9, 0x1d, 0x93, 0x79, 0x4e, 0x6e, 0xdd, 0x91
      , 0x92, 0xcd, 0x47, 0xc4, 0xe8, 0xd2, 0xf9, 0xba 
      , 0x0b, 0x5e, 0xca, 0x38, 0x92, 0xa8, 0xf9, 0x6e
      , 0x2a, 0xdc, 0x49, 0xaa, 0x0c, 0x0b, 0x4d, 0xff
      ]);
    test_vector(&mut двор_twistree,&text33,&
      [ 0xde, 0x94, 0xa0, 0x0c, 0xf4, 0x4c, 0x5a, 0xe2
      , 0xfb, 0xf7, 0x08, 0x3c, 0x9a, 0xdb, 0xda, 0x25 
      , 0xa0, 0x2a, 0x01, 0xfb, 0x68, 0x81, 0x94, 0x88
      , 0x8b, 0xc2, 0xbe, 0x1d, 0x6c, 0xae, 0x7b, 0x9c
      ]);
    test_vector(&mut двор_twistree,&text96,&
      [ 0xb1, 0x1b, 0x84, 0x9d, 0xf7, 0xb4, 0x15, 0xa3
      , 0xf9, 0xdc, 0x69, 0x47, 0xe1, 0xd2, 0xc0, 0x20 
      , 0x64, 0x0d, 0x8f, 0xf6, 0x79, 0xb6, 0x7b, 0x69
      , 0xbc, 0x70, 0xe1, 0x2e, 0x3d, 0xd7, 0xeb, 0x57
      ]);
    test_vector(&mut двор_twistree,&text59049,&
      [ 0xd2, 0xe3, 0x0f, 0x01, 0xa0, 0x32, 0x27, 0x51
      , 0x4e, 0x56, 0x44, 0xf1, 0x8f, 0x2e, 0x3e, 0xeb 
      , 0xdb, 0x14, 0x30, 0xba, 0x96, 0x2c, 0x47, 0x24
      , 0x4b, 0x79, 0x39, 0x58, 0xbc, 0x4f, 0x79, 0x25
      ]);
  }

}

}