A general purpose, high-speed encryption system and method, based on a linear feedback shift register (LFSR) that provides inputs to one or more mathematically independent nonlinear output functions, resulting in the generation of multiple keystream outputs per clock cycle. Due to the parallel architecture, the system need only operate at a rate of 1/N, where N is the number of output functions. For example, the system can encrypt an 8-bit byte in one-eighth the time required for a conventional bit-oriented stream cipher. Alternatively, with high-speed serial-to-parallel and parallel-to-serial interface converters, the system can encrypt a serial data stream at a rate N times that of the system itself.

High speed encryption system and method

We give a review of some known published applications of quasi- groups in cryptology. Keywords: cryptology, quasigroup, (r,s,t)-quasigroup, stream- cipher, secret-sharing system, zero knowledge protocol, authen- tication of a message, NLPN sequence, Hamming distance.

/pdf/quasigroups-in-cryptology-80neg8jkg0.pdf

Quasigroups in cryptology

The present invention is an apparatus and method of encryption. A first table comprising a set of 2n distinct n-bit input numbers and a first set of 2n distinct n-bit output numbers is received. A second table comprising of the set of 2n distinct n-bit input numbers and a second set of 2n distinct n-bit output numbers is also received. The first and second sets of 2n n-bit output numbers are each a one-to-one mapping of the set of 2n n-bit input numbers, and the second mapping of 2n n-bit output numbers is disjoint from the first mapping of 2n n-bit output numbers. The first and the second tables are combined and a fourth table of 2n pairs of (n+1)-bit numbers is generated by converting each of the 2n pairs of n-bit input numbers and each of the 2n pairs of n-bit output numbers in the third table, to (n+1)-bit numbers. Clear text (n+1)-bit data is then encrypted by providing the (n+1)-bit clear text data as inputs to the fifth table to obtain cipher text (n+1)-bit numbers as outputs.

High speed and method of providing high speed table generation for block encryption

We give a review of some known published applications of quasi- groups in cryptology Keywords: cryptology, quasigroup, (r,s,t)-quasigroup, stream- cipher, secret-sharing system, zero knowledge protocol, authen- tication of a message, NLPN sequence, Hamming distance

Permutations play an important role in the field of data security, representing a substantial contribution to increase the diffusion of the encryption process and many cryptosystems make use of them . However, in general, the literature on the subject reports very few results concerning those aspects of a permutation that make it atractive for cryptographic purposes. In this paper the subject is considered and, in the search for cryptographically strong permutations to be used in private or public cryptosystems, the problem of counting the number of permutations of degree n that fix i elements is approached.

/pdf/sobre-a-escolha-de-permutacoes-para-fins-criptograficos-46kafzzseu.pdf

Sobre a Escolha de Permutações para Fins Criptográficos

This paper suggests a scheme in which cryptographically strong permutations can be randomly selected from a large proper subset of the permutations on blocks of binary numbers which have certain properties of cryptographic strength that are independent of the underlying Boolean functions.

http://ieeexplore.ieee.org/iel4/5602/14996/00748547.pdf

L. Mittenthal

Papers

A Source of Cryptographically Strong Permutations for Use in Block Ciphers