6,426 research outputs found
A New Type of Cipher: DICING_csb
In this paper, we will propose a new type of cipher named DICING_csb, which
is derived from our previous stream cipher DICING. It has applied a stream of
subkey and an encryption form of block ciphers, so it may be viewed as a
combinative of stream cipher and block cipher. Hence, the new type of cipher
has fast rate like a stream cipher and need no MAC.Comment: There is a new variant added in the section
Fast, parallel and secure cryptography algorithm using Lorenz's attractor
A novel cryptography method based on the Lorenz's attractor chaotic system is
presented. The proposed algorithm is secure and fast, making it practical for
general use. We introduce the chaotic operation mode, which provides an
interaction among the password, message and a chaotic system. It ensures that
the algorithm yields a secure codification, even if the nature of the chaotic
system is known. The algorithm has been implemented in two versions: one
sequential and slow and the other, parallel and fast. Our algorithm assures the
integrity of the ciphertext (we know if it has been altered, which is not
assured by traditional algorithms) and consequently its authenticity. Numerical
experiments are presented, discussed and show the behavior of the method in
terms of security and performance. The fast version of the algorithm has a
performance comparable to AES, a popular cryptography program used commercially
nowadays, but it is more secure, which makes it immediately suitable for
general purpose cryptography applications. An internet page has been set up,
which enables the readers to test the algorithm and also to try to break into
the cipher in
Group theory in cryptography
This paper is a guide for the pure mathematician who would like to know more
about cryptography based on group theory. The paper gives a brief overview of
the subject, and provides pointers to good textbooks, key research papers and
recent survey papers in the area.Comment: 25 pages References updated, and a few extra references added. Minor
typographical changes. To appear in Proceedings of Groups St Andrews 2009 in
Bath, U
A note on some algebraic trapdoors for block ciphers
We provide sufficient conditions to guarantee that a translation based cipher
is not vulnerable with respect to the partition-based trapdoor. This trapdoor
has been introduced, recently, by Bannier et al. (2016) and it generalizes that
introduced by Paterson in 1999. Moreover, we discuss the fact that studying the
group generated by the round functions of a block cipher may not be sufficient
to guarantee security against these trapdoors for the cipher.Comment: to be published on Advances in Mathematics of Communication
Systematization of a 256-bit lightweight block cipher Marvin
In a world heavily loaded by information, there is a great need for keeping
specific information secure from adversaries. The rapid growth in the research
field of lightweight cryptography can be seen from the list of the number of
lightweight stream as well as block ciphers that has been proposed in the
recent years. This paper focuses only on the subject of lightweight block
ciphers. In this paper, we have proposed a new 256 bit lightweight block cipher
named as Marvin, that belongs to the family of Extended LS designs.Comment: 12 pages,6 figure
New results on the genetic cryptanalysis of TEA and reduced-round versions of XTEA
Congress on Evolutionary Computation. Portland, USA, 19-23 June 2004Recently, a simple way of creating very efficient distinguishers for cryptographic primitives such as block ciphers or hash functions, was presented by the authors. Here, this cryptanalysis attack is shown to be successful when applied over reduced round versions of the block cipher XTEA. Additionally, a variant of this genetic attack is introduced and its results over TEA shown to be the most powerful published to date
- …