Page 14 - tmp

NAUTILUS ENCRYPTION ALGORITHM

NEBOJŠA SIMIĆ

USTANIČKA 64

INTRODUCTION
This paper describes Nautilus encryption algorithm which Best way to use Nautilus is to use it as hash function.
I have constructed, designed and implemented. Algorithm Nautilus is strong one way function, it's impossible for
is designed in a way that it can be implemented for collision to occur, it has fixed output size, it's fast and it
multiple purposes with small changes or no changes at all. can take larger inputs. The fact that Nautilus is strong one
Nautilus can be used as compression algorithm, hash way function relies on a fact that is hard to determine
function, algorithm for bulk encryption and algorithm for relationship between 16 and 2401 characters or opposite.
continuous data stream encryption. All of stated uses of There cannot be collisions between 2 different texts
Nautilus differ just in number of rounds needed for because there is more plausible shuffles of input in C-box
encryption. than all plausible combinations of 16 character long text.
Also similar inputs will result in similar output ,which is
Nautilus isn't composed out of complicated one more desired property of perfect hash function.
computation steps so it could encrypt bigger blocks of
plain text. Time complexity of one round is quasilinear and This algorithm is implementable on processors
size of text is 7 times smaller than the text size in previous with little more memory space and processors that are
round and that provides faster encryption on bigger blocks little bit faster. It's ideal for server
of text.
implementation or for any computer system that
Nautilus is symmetric-key block cipher with works with large amount of data.
block size of 2401 characters and with variable key length.
Encryption has two phases first sub key computation, and Nautilus could be described as algorithm that is
plain text encryption. It iterates simple encryption and fast, multi-purpose, easily implementable, secure and
compression functions 4 times, but before encryption, keys cryptanalysis resistant. Nautilus isn't necessarily
must be computed. The block size can be up to 2401 cryptographic algorithm, it could be used as image
characters long or 16807 bits but key size is variable, it processing algorithm, steganography algorithm
varies from 16 characters to bigger, but choosing the and for many other purposes.
proper key length influences key computation time in big
measure. LITERATURE
[1] Christoforus Juan Benvenuto, Galois field in
Cryptography
[2] G. H. Hardy and E.M. Wright, Number theory

[3] James L. Massey ,The Discrete Fourier Transform in
Coding and Cryptography

[4] Erion Plaku and Igor E. Shparlinski ,On Polynomial
Representations of Boolean Functions Related to Some
Number Theoretic Problems

Figure 1Two Rounds of Nautilus Encryption Algorithm
CONCLUSION