BRAND
发表于 2025-3-30 11:04:02
Kin Chi Lau,Rafael Escobedo,David Barkine one-time public key by a standard signature. Second, we introduce a zero-knowledge variation on the Stern authentication scheme which permits to prove that one or two different syndromes are associated (or not) to the . low weight word. We give a polynomial reduction of the security of our scheme to the security of the syndrome decoding problem.
北极人
发表于 2025-3-30 13:45:19
http://reply.papertrans.cn/25/2406/240565/240565_52.png
Exonerate
发表于 2025-3-30 18:49:08
Reshma Yousuf,Zawiah Abdul Majidus methods have recommended, while still maintaining reasonable levels of security. As example applications we look at the evaluation of AES via FHE operations presented at Crypto 2012, and the parameters for the SHE variant of BGV used in the SPDZ protocol from Crypto 2012.
出来
发表于 2025-3-30 20:43:10
Semi-bent Functions from Oval Polynomialstwo areas are important from a theoretical point of view and for applications), the connections between finite geometry and cryptography remain little studied. In 2011, Carlet and Mesnager have showed that projective finite geometry can also be useful in constructing significant cryptographic primit
Pituitary-Gland
发表于 2025-3-31 02:04:40
http://reply.papertrans.cn/25/2406/240565/240565_55.png
磨碎
发表于 2025-3-31 06:28:10
http://reply.papertrans.cn/25/2406/240565/240565_56.png
现晕光
发表于 2025-3-31 10:53:33
http://reply.papertrans.cn/25/2406/240565/240565_57.png
grudging
发表于 2025-3-31 16:00:34
http://reply.papertrans.cn/25/2406/240565/240565_58.png
inundate
发表于 2025-3-31 17:29:55
On Minimal and Quasi-minimal Linear Codesuch codes have applications in cryptography, e.g. to secret sharing. We here study minimal codes, give new bounds and properties and exhibit families of minimal linear codes. We also introduce and study the notion of quasi-minimal linear codes, which is a relaxation of the notion of minimal linear c
纯朴
发表于 2025-3-31 23:17:45
http://reply.papertrans.cn/25/2406/240565/240565_60.png