نتایج جستجو برای: آلومینیوم gost 4784 97

تعداد نتایج: 57830  

2009
Jieun Kim Amy Hyeyun Jung Jayoung Byun Suhyun Jo Min Whan Jung

Several lines of evidence suggest the involvement of prefrontal cortex in time interval estimation. The underlying neural processes are poorly understood, however, in part because of the paucity of physiological studies. The goal of this study was to establish an interval timing task for physiological recordings in rats, and test the requirement of intact medial prefrontal cortex (mPFC) for per...

Journal: :Ferrous Metallurgy. Bulletin of Scientific , Technical and Economic Information 2019

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تهران 1361

چکیده ندارد.

در پژوهش حاضر، یک روش مبتکرانه، ساده و کم هزینه برای ایجاد سطح میکرو- نانوساختار ابرآبگریز بر روی آلیاژ آلومینیوم بدون مصرف برق پیشنهاد شد. زاویه تماس قطره آب بر روی سطح ابرآبگریز ایجاد شده °1/167 اندازه گیری شد. میکرو- نانوزبری­های ایجاد شده در سطح به کمک میکروسکوپ الکترونی روبشی مشاهده گردید. آنالیز شیمیایی سطح توسط آنالیز EDS صورت گرفت و حضور ترکیبات با زنجیره­های کربنی مشخص گردید. تأثیر زما...

2008
L. KOVALCHUK

The paper discusses the Feistel cipher with a block size of n = 2m, where the addition of a round key and a part of an incoming massage in each round is carried out modulo 2m. In order to evaluate the security of such a cipher against differential and linear cryptanalyses, the new parameters of cipher s-boxes are introduced. The upper bounds of maximum average differential and linear probabilit...

Journal: :IACR Cryptology ePrint Archive 2015
Jian Zou Le Dong

The Kupyna hash function was selected as the new Ukrainian standard DSTU 7564:2014 in 2015. It is designed to replace the old Independent States (CIS) standard GOST 34.311-95. The Kupyna hash function is an AES-based primitive, which uses Merkle-Damg̊ard compression function based on Even-Mansour design. In this paper, we show the first cryptanalytic attacks on the round-reduced Kupyna hash func...

Journal: :IACR Cryptology ePrint Archive 2011
Nicolas Courtois Daniel Hulme Theodosis Mourouzis

One of the hardest practical problems in computer science is the problem of gate-efficient implementation. Such optimizations are particularly important in industrial hardware implementations of standard cryptographic algorithms. In this paper we focus on optimizing some small digital circuits such as S-boxes in some well-known ciphers. We consider the notion of Multiplicative Complexity which ...

2013
Alex Biryukov Ivica Nikolic

In this paper, we propose related-key differential distinguishers based on the complementation property of Feistel ciphers. We show that with relaxed requirements on the complementation, i.e. the property does not have to hold for all keys and the complementation does not have to be on all bits, one can obtain a variety of distinguishers. We formulate criteria sufficient for attacks based on th...

1994
Michael Roe

– The NIST Secure Hash Algorithm (SHA) has been replaced with a new algorithm, SHA-1 [10]. The reason for this change is that NIST (or NSA) discovered an attack against the original SHA algorithm [11]. – This year’s measurements are based on a faster implementation of GOST 28147. – This year’s measurements were made with a different Sun workstation. The new machine is significantly slower; as a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید