نتایج جستجو برای: 3 – pass
تعداد نتایج: 1846153 فیلتر نتایج به سال:
HAVAL is a cryptographic hash function proposed in 1992 by Zheng, Pieprzyk and Seberry. Its has a structure that is quite similar to other well-known hash functions such as MD4 and MD5. The specification of HAVAL includes a security parameter: the number of passes (that is, the number of times that a particular word of the message is used in the computation) can be chosen equal to 3, 4 or 5. In...
در این گزارش، آقای 40 ساله ای معرفی می شود که با سابقه درد پهلو و کاهش وزن در ماههای اخیر مراجعه کرده بود. یافته سونوگرافیک در این بیمار یک توده در آدرنال چپ بود که با ct scan نیز تایید شده بود. پس از بررسی توسط میکروسکوپ نوری و ایمونوهیستوشیمی (immunohistochemisty) براساس (pass=pheochromocytoma of adrenal gland scaled score) تشخیص فئوکروموسیتوم با نمای هیستولوژیک بدخیم گذاشته شد.
In 1992, Zheng, Pieprzyk and Seberry proposed a one-way hashing algorithm called HAVAL, which compresses a message of arbitrary length into a digest of 128, 160, 192, 224 or 256 bits. It operates in so called passes where each pass contains 32 steps. The number of passes can be chosen equal to 3, 4 or 5. In this paper, we devise a new differential path of 3-pass HAVAL with probability 2−114, wh...
Objective: The purpose of the present study was to assess the reliability of PASS in evaluating the self-care skills of patient suffering from multiple sclerosis. Materials & Methods: The present study is an analytic-descriptive study in which 30 adults suffering from multiple sclerosis (MS) underwent reliability evaluation of PASS in Tehran city with an interval of two weeks. Participants w...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید