Abstract: Quasigroups are algebraic structures closely related to
Latin squares which have many different applications. The
construction of block cipher is based on quasigroup string
transformation. This article describes a block cipher based
Quasigroup of order 256, suitable for fast software encryption of
messages written down in universal ASCII code. The novelty of this
cipher lies on the fact that every time the cipher is invoked a new set
of two randomly generated quasigroups are used which in turn is
used to create a pair of quasigroup of dual operations. The
cryptographic strength of the block cipher is examined by calculation
of the xor-distribution tables. In this approach some algebraic
operations allows quasigroups of huge order to be used without any
requisite to be stored.
Abstract: Smoothing or filtering of data is first preprocessing step
for noise suppression in many applications involving data analysis.
Moving average is the most popular method of smoothing the data,
generalization of this led to the development of Savitzky-Golay filter.
Many window smoothing methods were developed by convolving
the data with different window functions for different applications;
most widely used window functions are Gaussian or Kaiser. Function
approximation of the data by polynomial regression or Fourier
expansion or wavelet expansion also gives a smoothed data. Wavelets
also smooth the data to great extent by thresholding the wavelet
coefficients. Almost all smoothing methods destroys the peaks and
flatten them when the support of the window is increased. In certain
applications it is desirable to retain peaks while smoothing the data
as much as possible. In this paper we present a methodology called
as peak-wise smoothing that will smooth the data to any desired level
without losing the major peak features.