In this paper we present an algorithm for finding low-weight multiples of polynomials over the binary field using coding theoretic methods. The code defined by the public polynomial is cyclic, allowing an attacker to search for any shift of the sought codeword. Therefore, a code with higher length and dimension is used, having a larger number of low-weight codewords. Additionally, since the deg...

the term “sānād” i-e (persian historical document) is an important key word in history. although there are many researches about purport, applicable field of “sanad” but historical linguistic of this term is little-known. in regard to that this word have not a long use by mean “written” and “document” in  iranian historical texts, therefore  mind question of this article is: when this term in r...

<p>This paper proposes a new algorithm for text encryption utilizing English words as unit of encoding. The vanishes any feature that could be used to reveal the encrypted through adopting variable code lengths words, variable-length key, applying two-dimensional binary shuffling techniques at bit level, and four logical operations with randomized inputs. alphabetically sorted are divided...