نتایج جستجو برای: universal message
تعداد نتایج: 172516 فیلتر نتایج به سال:
This paper discusses key recovery and universal forgery attacks on several MAC algorithms based on universal hash functions. The attacks use a substantial number of verification queries but eventually allow for universal forgeries instead of existential or multiple forgeries. This means that the security of the algorithms completely collapses once a few forgeries are found. Some of these attack...
In an effort to design a MAC scheme that is built using block cipher components and runs faster than the modes of operation for message authentication, Daemen and Rijmen have proposed a generic MAC construction ALRED and a concrete ALRED instance Pelican. The Pelican MAC uses four rounds of AES as a building block to compute the authentication tag in a CBC-like manner. It is about 2.5 times fas...
Due to the increasing use of wireless communications, infrastructure-less networks such as Delay Tolerant Networks (DTNs) should be highly considered. DTN is most suitable where there is an intermittent connection between communicating nodes such as wireless mobile ad hoc network nodes. In general, a message sending node in DTN copies the message and transmits it to nodes which it encounters. A...
We introduce two types of message passing algorithms for quantified Boolean formulas (QBF). The first type is a message passing based heuristics that can prove unsatisfiability of the QBF by assigning the universal variables in such a way that the remaining formula is unsatisfiable. In the second type, we use message passing to guide branching heuristics of a Davis-Putnam Logemann-Loveland (DPL...
chapter two presents three m-admissible function algebras ab, bd, and sl, to construct the universal abelian, band, and semilattice compactifications, respectively. the main results are (11.3), (12.3), and (12.4). some inclusion relationships between these function algebras and the other well-known ones, presented in section 8, are made via the devico of compactifications. chpter three is about...
This paper presents two classes of universal constructs that occur in distributed computations and explores their properties. It first examines a pair of universal constructs termed IO and OI intervals that occur at nodes in distributed computations. These universal constructs are used as building blocks to design two global universal constructs, termed segments and paths, that occur across nod...
deviation from the norm in al-sahifa al-sajjadiyah abstract literature deals with the arrangement and decoration of language with a beautiful form and an impressive message. foregrounding and deviation from the norm are the outcome of the manipulation of standard language in its phonology, semantics, lexis, syntax, and dialects, among other aspects. al-sahifa al-sajjadiyah is among the most val...
We answer an open question about Quantum Key Recycling (QKR): Is it possible to put the message entirely in qubits without increasing number of compared existing QKR schemes? show that this is indeed possible. introduce a prepare-and-measure protocol where communication from Alice Bob consists qubits. As usual, responds with authenticated one-bit accept/reject classical message. Compared Distri...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید