In this technical report, we consider ultra light-weight constructions of message authentication in hardware applications. We examine several known constructions and evaluate details around their hardware implementations. These constructions are all based on the framework of universal hash functions.

the purpose of the present paper is to survey and analyse the concept and significance of religious tolerance and universal brotherhood in imam ali’s teachings, especially his nahj al balagha. islam admits the freedom of thought, free expression of opinions, and exercise of independent judgment in religious matters. it also acknowledges tolerance among religions, religious communities, nations ...

We give a new deenition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authenti-cation codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.

This article provides a commentary to Ole Norheim' s editorial entitled "Ethical perspective: Five unacceptable trade-offs on the path to universal health coverage." It reinforces its message that an inclusive, participatory process is essential for ethical decision-making and underlines the crucial importance of good governance in setting fair priorities in healthcare. Solidarity on both natio...

We describe collaboration models in Web services, and how to achieve universal access in the heterogeneous devices including conventional desktop PCs and mobile devices. We discuss how a rich synchronous and asynchronous collaboration environment can support virtual communications built on top of Web service infrastructure based on industry standard portal technologies, such as XML, Apache proj...

Solomonoff induction is known to be universal, but incomputable. Its approximations, namely, the Minimum Description (or Message) Length (MDL) principles, are adopted in practice in the efficient, but non-universal form. Recent attempts to bridge this gap leaded to development of the Representational MDL principle that originates from formal decomposition of the task of induction. In this paper...

One can check that every tree which is finite is also finite-order. The following propositions are true: (1) For every decorated tree t holds t ε = t. (2) For every tree t and for all finite sequences p, q of elements of such that p q ∈ t holds t (p q) = t p q. (3) Let t be a decorated tree and let p, q be finite sequences of elements of . If p q ∈ dom t, then t (p q) = t p q. A decorated tree ...

Hash then encrypt” is a popular approach to message authentication: first the message is hashed down using an ε-universal hash function, and then the resulting k-bit value is encrypted, say with a block-cipher. The security of this scheme is proportional to εq, where q is the number of MACs the adversary can request. As ε is at least 2, the best one can hope for is O(q/2) security. Unfortunatel...

Current approaches of phishing filters depend on classifying messages based on textually discernable features such as IP-based URLs or domain names as those features that can be easily extracted from a given phishing message. However, in the same sense, those easily perceptible features can be easily manipulated by sophisticated phishers. Therefore, it is important that universal patterns of ph...

With recently widespread use of mobile phones and SMS communication in Iran and reformulation of conventional communication practices, short message advertisements have recently started to gain prominence in the world of advertisement as a quick, less costly, available and reliable means of introducing the products and services offered by the companies and institutions. With this in mind, the p...