نتایج جستجو برای: block shift

تعداد نتایج: 292841  

2010
Huihui Yap Khoongming Khoo Axel Poschmann

The n-cell GF-NLFSR (Generalized Feistel-NonLinear Feedback Shift Register) structure [8] is a generalized unbalanced Feistel network that can be considered as a generalization of the outer function FO of the KASUMI block cipher. An advantage of this cipher over other n-cell generalized Feistel networks, e.g. SMS4 [11] and Camellia [5], is that it is parallelizable for up to n rounds. In hardwa...

Journal: :IACR Cryptology ePrint Archive 2010
Huihui Yap Khoongming Khoo Axel Poschmann

The n-cell GF-NLFSR (Generalized Feistel-NonLinear Feedback Shift Register) structure [8] is a generalized unbalanced Feistel network that can be considered as a generalization of the outer function FO of the KASUMI block cipher. An advantage of this cipher over other n-cell generalized Feistel networks, e.g. SMS4 [11] and Camellia [5], is that it is parallelizable for up to n rounds. In hardwa...

2009
Wenling Wu Lei Zhang Liting Zhang Wentao Zhang

The overall structure is one of the most important properties of block ciphers. At present, the most common structures include Feistel structure, SP structure, MISTY structure, L-M structure and Generalized Feistel structure. In [29], Choy et al. proposed a new structure called GF-NLFSR (Generalized Feistel-NonLinear Feedback Shift Register), and designed a new block cipher called Four-Cell whi...

2012
Amandeep Kaur Harsh Kumar Verma Ravindra Kumar Singh William Stallings Behrouz A. Forouzan Johannes A. Buchmann Dhiren R. Patel Tim Spiller

layfair cipher is the well-known multiple letter encryption cipher. Here the digraphs in the plaintext are treated as single units and converted into corresponding cipher text digraphs. However because of the drawbacks inherent in the 5 X 5 Playfair cipher which adversely affects the security we proposed a 6 X 6 Playfair cipher and then coupled it with Linear Feedback Shift Register based Uniqu...

2004
MIKE BOYLE

A block code from an irreducible shift of finite type can be lifted canonically through resolving maps to a resolving map. There is an application to Markovian maps.

Journal: :Circulation research 1983
P Savard D Cohen E Lepeschkin B N Cuffin J E Madias

The direct-current magnetocardiogram not only shows the features usually seen on the electrocardiogram, but also shows the T-Q (baseline) shift due to cardiac injury current. The first direct-current magnetocardiogram measurements of the human heart are presented here. The hypothesis tested is that there is no injury current associated with the S-T shift seen in two electrocardiogram abnormalit...

2011
RONNIE PAVLOV

In one dimension, sofic shifts are fairly well-understood and special examples of shift spaces which must satisfy very restrictive properties. However, in multiple dimensions there are very few known conditions which guarantee nonsoficity of a shift space. In this paper, we show that for any Z sofic shift X which satisfies a uniform mixing condition called block gluing in all directions ~ e2, ....

Journal: :CoRR 2015
Abhinav Jangda

Softwares source code is becoming large and complex. Compilation of large base code is a time consuming process. Parallel compilation of code will help in reducing the time complexity. Parsing is one of the phases in compiler in which significant amount of time of compilation is spent. Techniques have already been developed to extract the parallelism available in parser. Current LR(k) parallel ...

Journal: :Topology and its Applications 2021

The purpose of this article is twofold. On one hand, we reveal the equivalence shift finite type between a one-sided X and its associated hom tree-shift TX, as well in sofic shift. other investigate interrelationship among comparable mixing properties on tree-shifts those multidimensional spaces. They include irreducibility, topologically mixing, block gluing, strong all which are defined spiri...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید