D
1 блок - 5 секунд
Size: a a a
2020 August 08
p
1 апреля, уже прошёл, а что? - это кодировка,? 5 = a вот это вряд ли можно понять точность double (это не только.
🦊
Я сомневаюсь, что ты на таком страшном девайсе чего-либо быстрого добьешься
🦊
Тем более на питоне
f&
кто подскажет какое количество итераций в классической реализации 8 битной версии AES128?
кажется, 8 раундов.
D
а если вот это реализовать:
On systems with 32-bit or larger words, it is possible to speed up execution of this cipher by combining the SubBytes and ShiftRows steps with the MixColumns step by transforming them into a sequence of table lookups. This requires four 256-entry 32-bit tables (together occupying 4096 bytes). A round can then be performed with 16 table lookup operations and 12 32-bit exclusive-or operations, followed by four 32-bit exclusive-or operations in the AddRoundKey step.
On systems with 32-bit or larger words, it is possible to speed up execution of this cipher by combining the SubBytes and ShiftRows steps with the MixColumns step by transforming them into a sequence of table lookups. This requires four 256-entry 32-bit tables (together occupying 4096 bytes). A round can then be performed with 16 table lookup operations and 12 32-bit exclusive-or operations, followed by four 32-bit exclusive-or operations in the AddRoundKey step.
f&
но это не точно
D
10 раундов
f&
а если вот это реализовать:
On systems with 32-bit or larger words, it is possible to speed up execution of this cipher by combining the SubBytes and ShiftRows steps with the MixColumns step by transforming them into a sequence of table lookups. This requires four 256-entry 32-bit tables (together occupying 4096 bytes). A round can then be performed with 16 table lookup operations and 12 32-bit exclusive-or operations, followed by four 32-bit exclusive-or operations in the AddRoundKey step.
On systems with 32-bit or larger words, it is possible to speed up execution of this cipher by combining the SubBytes and ShiftRows steps with the MixColumns step by transforming them into a sequence of table lookups. This requires four 256-entry 32-bit tables (together occupying 4096 bytes). A round can then be performed with 16 table lookup operations and 12 32-bit exclusive-or operations, followed by four 32-bit exclusive-or operations in the AddRoundKey step.
> on systems with 32-bit words
просто напиши ChaCha20 хоспаде
просто напиши ChaCha20 хоспаде
f&
идеальный шифр для 32-bit words
TS
только чистый питон
Пиши на си
🦊
а если вот это реализовать:
On systems with 32-bit or larger words, it is possible to speed up execution of this cipher by combining the SubBytes and ShiftRows steps with the MixColumns step by transforming them into a sequence of table lookups. This requires four 256-entry 32-bit tables (together occupying 4096 bytes). A round can then be performed with 16 table lookup operations and 12 32-bit exclusive-or operations, followed by four 32-bit exclusive-or operations in the AddRoundKey step.
On systems with 32-bit or larger words, it is possible to speed up execution of this cipher by combining the SubBytes and ShiftRows steps with the MixColumns step by transforming them into a sequence of table lookups. This requires four 256-entry 32-bit tables (together occupying 4096 bytes). A round can then be performed with 16 table lookup operations and 12 32-bit exclusive-or operations, followed by four 32-bit exclusive-or operations in the AddRoundKey step.
Попробуй, звучит, как разумная оптимизация
TS
Си есть везде
D
у меня железо под питон заточено
D
там нет си
TS
там нет си
Там есть си
f&
Попробуй, звучит, как разумная оптимизация
она как раз порождает тайминг атаки))0)0)0
D
подскажите как оптимизация может повлиять на быстродействие?
f&
подскажите как оптимизация может повлиять на быстродействие?
эээээээ
напрямую?
напрямую?