نتایج جستجو برای: interactive guessing from context strategy
تعداد نتایج: 6059156 فیلتر نتایج به سال:
even though, to date, a lot of studies have been conducted on the subject of politeness theory, there are very few studies regarding the applicability of this theory to translation between english and persian which shows the reason behind conducting the present study. this study was carried out with the aim of highlighting whether there is any difference between english and persian methods of u...
The two cerebral hemispheres are specialised for different cognitive functions, and which hemisphere's strategy is superior depends on the nature of the task. A new study of split-brain patients has provided another unexpected insight: the two hemispheres use different strategies when performing a guessing task.
What happens when you use a partially defective bit-commitment protocol to commit to the same bit many times? For example, suppose that the protocol allows the receiver to guess the committed bit with advantage ε, and that you used that protocol to commit to the same bit more than 1/ε times. Or suppose that you encrypted some message many times (to many people), only to discover later that the ...
Guessing, or dictionary, attacks arise when an intruder exploits the fact that certain data like passwords may have low entropy, i.e. stem from a small set of values. In the case of off-line guessing, in particular, the intruder may employ guessed values to analyze the messages he has observed. Previous attempts at formalizing off-line guessing consist of extending a Dolev-Yao-style intruder mo...
In our constribution we explore a combination of local reduction with the method of syllogisms and the applications of generic guessing strategies in the cryptanalysis of the block cipher GOST. Our experiments show that GOST with 64/128/256 bit key requires at least 12/16/22 rounds to achieve full bit security against the method of syllogisms combined with the ,,maximum impact” strategy.
In this paper, we present an experimental analysis of HFE Challenge 2 (144 bit) type systems. We generate scaled versions of the full challenge fixing and guessing some unknowns. We use the MXL3 algorithm, an efficient algorithm for computing Gröbner basis, to solve these scaled versions. We review the MXL3 strategy and introduce our experimental results.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید