Lexical inferencing is one of the most important strategies in vocabulary learning and it plays an important role in dealing with unknown words in a text. In this regard, the aim of this study was to determine the lexical inferencing strategies used by Iranian EFL learners when they encounter unknown words at both text and sentence levels. To this end, forty lower intermediate students were div...

1 In this article an optimal selection of tap positions for certain LFSR-based encryption schemes is investigated from both design and cryptanalytic perspective. Two novel algorithms towards an optimal selection of tap positions are given which can be satisfactorily used to provide (sub)optimal resistance to some generic cryptanalytic techniques applicable to these schemes. It is demonstrated t...

PURPOSE To determine whether patients can guess their intraocular pressure (IOP). DESIGN Patient survey. METHODS We asked consecutive patients to guess their IOP and then indicate the IOP and the symptoms that allowed them to guess. RESULTS Of 132 patients, 22 (17%) believed they could guess their IOP, usually based on a periocular symptom (n = 20, 91%). Nine of these patients (45%) corre...

At EUROCRYPT 2012 Pandey and Rouselakis introduced the notion of property preserving symmetric encryption which enables checking for a property on plaintexts by running a public test on the corresponding ciphertexts. Their primary contributions are: (i) a separation between ‘find-then-guess’ and ‘left-or-right’ security notions; (ii) a concrete construction for left-or-right secure orthogonalit...

The impossible differential attack is one of the most fundamental tools cryptanalysis and has been successfully applied to a large variety block ciphers. In typical attack, foundation first step construct an differential. Nowadays, two kinds commonly used approaches in construction are matrix-based tool-aided automatic search methods. this paper, we proposed new method combining early-abort str...

QuiSci is incredible fast, faster than most other ciphers. On modern CPUs it needs only arround 1 clock cycle per byte, so it is 10 times fast than most other well-known algorithm. On the website of QuiSci [1] it is claimed that this algorithm is secure. With this paper I like to show a key recovery attack on QuiSci, exploiting the weak key setup. When you are able to guess the beginning of the...

Normally computer users use a passphrase or a password to encrypt secret values in computer systems. In this case, to prevent the brute–force attack, the password should be long enough and difficult to guess. But, such kind of passwords are also difficult for the human beings to remember. In this paper, we propose a method for protecting secret keys. A secret key means secret value like the pas...