ваш_домен.ru

Краткое описание вашей конференции
Текущее время: 03 июл 2024, 07:50

Часовой пояс: UTC




Начать новую тему Ответить на тему  [ 1 сообщение ] 
Автор Сообщение
 Заголовок сообщения: Ecrypt ii hash workshop 2024
СообщениеДобавлено: 09 июн 2024, 18:08 
Не в сети
Раздал: 0 байт
Скачал: 0 байт
Ратио: Inf.


Зарегистрирован: 02 июн 2024, 04:11
Сообщения: 8187


===>>GO TO THE STORE<<===


п»їHow is the MJH double-block-length hash function constructed?
I'm looking for information on the MJH double-block-length hash function, but the best free source I could find is the diagram on page 18 of Efficient hashing using the AES Instruction Set (submitted to the ECRYPT II Hash Workshop 2011). Is source code available for this function? What are the standard symbols used (M, V, Z) when describing hash functions?
22.7k 7 7 gold badges 80 80 silver badges 117 117 bronze badges.
asked Sep 10, 2011 at 13:18.
561 5 5 silver badges 13 13 bronze badges.
$\begingroup$ I'll elaborate this to an answer later (if not someone else does it first), but here about the meanings of the symbols used in the diagram (as I understand them): n is the block size of the block cipher, k the key size. M and V are inputs to the compression function (M typically being one message block, V the state of the hash function), Z is the output (same size as V, and the new state of the hash function). $\endgroup$
Sep 11, 2011 at 1:01.
1 Answer 1.
$\begingroup$
I had a look at the paper introducing the MJH construction (MJH: A Faster Alternative to MDC-2).
It actually presents a different diagram than the one in the paper Efficient hashing using the AES Instruction Set your referenced – there $V_2$ and $M$ are swapped. I'll describe the original one here, and the variation below.
The core of MJH is a compression function, using a similar construction like the JH hash function (one of the SHA-3 finalists), hence the name.
The JH construction.
Given a (non-compressing) function $F : \ ^ \to \^$ , we define the compression function $JH[F] : \^ \to \^$ as $JH[F](V_1, V_2, M) := (Z_1, Z_2)$ , with $(X_1, X_2) = (V_1, V_2 \oplus M)$ , $(Y_1, Y_2) = F(X_1, X_2)$ and $(Z_1, Z_2) := (Y_1 \oplus M, Y_2)$ .
In the JH hash function, F is a specially-made (fixed) permutation.
MJH's $F[\sigma, \theta]$
Given a $n$ -bit-blockcipher $E$ with keysize $k = n$ , $\sigma : \^ \to \^n$ an involution (i.e. $\sigma \circ \sigma = \mathrm$ ) without fixed point (i.e. $\sigma(X) \neq X$ ) – an example would be an XOR with a non-zero constant –, and $\theta \in \mathbb_ \setminus\$ a constant (so multiplication with $\theta$ is another non-trivial permutation).
We define $F[\sigma, \theta] : \^ \to \^$ as $F(X, K) = (L, R)$ , with $L = E_K(X) \oplus X$ and $R := \theta(E_K(\sigma(X)) \oplus \sigma(X) ) \oplus X$ .
(The $E_K(X) \oplus X$ part is essentially the Davies-Meyer construction to make it one-way, even if $K$ is known. It is actually used twice here.)
The final Hash function.
Combining these ideas, we get our compression function $\tilde F[\sigma, \theta] := JH[F[\sigma, \theta]] : \^ \to \^$ .
We then apply the known Merkle–Damgård caining construction on this compression function, receiving our final hash function $H[\sigma, \theta] = MD[\tilde F[\sigma, \theta]]$ .
(This image is from Wikimedia Commons, the others are made by me.)
In practice we now also have to choose some specific $\sigma$ and $\theta$ , a specific block cipher, as well as an initialization vector and padding for MD - the security proof still applies for all of them (if the block cipher is good).
Longer key variant.
The paper also describes a variant of the compression function to be used when the key length $k$ is greater than the block size $n$ . Then we use message blocks of size $k$ , and split these blocks into two parts $z, z'$ . $z$ (of size $n$ )is used as before to be XOR'ed into the left half of the state before encryption and right half after, while $z'$ (of size $k-n$ ) is appended to the right half of the state to form the key for the block cipher.
By using a larger (hash) block size, this longer variant can be more efficient than the original one.
The variant depicted in Efficient Hashing.
For $n = k$ , this is the same compression function as the original one, but it is used in a different way in the MD-construction: Here the message blocks are passed in the key position, instead of being XOR'ed into the parts of the state before and after encryption. (This XOR'ing instead uses one half of the original state.)
This gives a more obvious generalization into the $k \geq n$ case, as we don't have to split the message block and compose the key, but simply can pass the longer key to the block cipher.
I didn't check if the proofs given in the MJH paper also apply to this variant, though, and I don't know which version the authors of Efficient Hashing actually measured.


shisha price
buy horney goat weed plants
cbd oil for sale in canada
5 pounds of weed price
og skywalker price
buy thc carts illinois
age to buy weed in nj
lamont's bishops house perth cbd
price of weed per quarter
andromeda strain tv series online
cheap dab radio tesco
how to get medical marijuana card in tampa
shisha tabacco buy online
lockheed martin skunk works store
tesco store dab radios
fumo shisha buy
buy concentrated thc
weed shop 3 employees
hash oil pen online
marijuana anonymous podcast
can i purchase marijuana in tennessee
weed shop with
can you buy weed seeds in the united states
portable dab radios for sale
gorilla glue 60ml wholesale
bubble hash machine for sale uk
how to get a medical marijuana card on long island
marijuana anonymous ithaca
strain energy stored in simply supported beam
dispensary prices for weed
thc oil for sale australia
oil rig for dabs sale
northern lights limited to santa's train workshop
mr bean coffee shop bangi
dab radio cd players best buy
weed cart battery for sale
where can you buy roundup weed killer
mota smart ring buy
time ordered hash
northern lights strain clones for sale
buy cannabis seeds online australia
watermelon gelato strain price
hobby shop melbourne cbd
medical marijuana farm for sale
shisha store london
crystal rock candy pops wholesale
acapulco gold weed price
can i buy weed on dc
buy cali weed australia
buy cannabis vodka online uk

Medical marijuana doctor online ohio
Thc vaporizer pen for sale 1
Cheap parking sydney cbd weekend
Islamic relief charity shop bangi
Legal high weed for sale
Don t ever buy no weed from the gas station gif
Miinot gelato prices
Shopping centre near melbourne cbd
Can you buy recreational weed in new york city
Bc northern lights bloom box price
Order weed in australia


Вернуться к началу
 Профиль  
Ответить с цитатой  
Показать сообщения за:  Поле сортировки  
Начать новую тему Ответить на тему  [ 1 сообщение ] 

Часовой пояс: UTC


Кто сейчас на конференции

Сейчас этот форум просматривают: Apkcwo, Bing [Bot], DavidBrido, Google [Bot], iwaewwim, kiyocesomil, MarionWhita, Methrentot, Tutorials71, wormdrink, xajitixicisi и гости: 9


Вы не можете начинать темы
Вы не можете отвечать на сообщения
Вы не можете редактировать свои сообщения
Вы не можете удалять свои сообщения
Вы не можете добавлять вложения

Найти:
Перейти:  
cron
Создано на основе phpBB® Forum Software © phpBB Group
ppkBB3cker v.2 © 2008-2017 @ PPK | Icon Theme by Everaldo.com Design Studio
Русская поддержка phpBB
Ресурс не предоставляет электронные версии произведений, а занимается лишь коллекционированием и каталогизацией ссылок, присылаемых и публикуемых на форуме нашими читателями. Если вы являетесь правообладателем какого-либо представленного материала и не желаете чтобы ссылка на него находилась в нашем каталоге, свяжитесь с нами и мы незамедлительно удалим её. Файлы для обмена на трекере предоставлены пользователями сайта, и администрация не несёт ответственности за их содержание. Просьба не заливать файлы, защищенные авторскими правами, а также файлы нелегального содержания!