讽刺滑稽戏剧
发表于 2025-3-25 03:19:01
A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sie978-94-015-0929-9
FLAX
发表于 2025-3-25 09:03:15
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity978-1-349-21255-2
VEN
发表于 2025-3-25 15:21:01
http://reply.papertrans.cn/15/1475/147484/147484_23.png
contrast-medium
发表于 2025-3-25 17:15:16
More Powerful and Reliable Second-Level Statistical Randomness Tests for NIST SP 800-22978-3-658-31015-8
cylinder
发表于 2025-3-25 22:48:06
http://reply.papertrans.cn/15/1475/147484/147484_25.png
glacial
发表于 2025-3-26 01:25:11
https://doi.org/10.1007/978-3-030-89824-3Lercier and the Conjugation method of polynomial selection proposed at Eurocrypt 2015 and the extension of these methods to the tower number field scenario by Kim and Barbulescu. A thorough analysis of the new algorithm is carried out in both concrete and asymptotic terms.
Harass
发表于 2025-3-26 08:14:36
http://reply.papertrans.cn/15/1475/147484/147484_27.png
Introduction
发表于 2025-3-26 10:26:31
https://doi.org/10.1007/978-3-030-89824-3 1 cycle per byte for . and .. For larger permutations, where moving data in memory has a more pronounced effect, Simpira with . (512 byte inputs) evaluates 732 AES rounds, and performs at 824 cycles (1.61 cycles per byte), which is less than . off the theoretical optimum. If the data is stored in i
污点
发表于 2025-3-26 13:41:13
http://reply.papertrans.cn/15/1475/147484/147484_29.png
pulmonary-edema
发表于 2025-3-26 19:51:45
https://doi.org/10.1007/978-3-319-62018-3tographic hash functions is to reconsider and simplify the round function of the Knudsen-Nyberg cipher from 1995. The mapping . is used as the main component there and is also the main component of our family of proposals called “MiMC”. We study various attack vectors for this construction and give