不能根除
发表于 2025-3-27 00:55:22
Efficient Generation of Elementary Sequencesmputing certain linear combinations of its registers. We ran experiments for all irreducible polynomials of degree . up to 14 and for each . we found that efficient methods exist for at least one m-sequence. A combination of the two approaches above is also described.
metropolitan
发表于 2025-3-27 02:19:00
http://reply.papertrans.cn/25/2406/240565/240565_32.png
Insufficient
发表于 2025-3-27 05:50:18
A Code-Based Undeniable Signature Schemee 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.
MENT
发表于 2025-3-27 12:29:07
Hashing Mode Using a Lightweight Blockciphermness of the keyed hashing mode under standard assumptions of an underlying blockcipher. The analysis in the standard model is practically more significant than the analysis in the ideal-primitive model.
NEG
发表于 2025-3-27 17:05:23
Estimating Key Sizes for High Dimensional Lattice-Based Systemsus 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-27 20:57:58
https://doi.org/10.1007/978-981-99-1541-5 due to their algebraic and combinatorial properties. In this paper, we show that oval polynomials (which are closely related to the hyperovals of the projective plane) give rise to several new constructions of infinite classes of semi-bent Boolean functions in even dimension.
躲债
发表于 2025-3-27 22:33:02
Application of Wood Waste in Agriculture,sults of the primitives we have implemented using the recently released HElib. In the conclusions we discuss our findings for the different primitives we have analyzed to draw a general conclusion on the homomorphic evaluation of symmetric cryptographic primitives.
Infraction
发表于 2025-3-28 04:05:57
Richard Siegesmund,Tony Gee,Warren Lindsermediary step in the construction. Finally we show that RFEs constructed in this way can be used to construct FHE schemes thereby establishing a relation between the FHE and FE primitives. We conclude the paper by recasting the construction of RFE schemes in the context of obfuscation.
Hirsutism
发表于 2025-3-28 10:20:10
Nor Aida Abdul Rahman,Nurhayati Mohd Nur on top of any block cipher, and it does not require to increase the key-length. We use an . (or ERF) as a building block and we propose a concrete and efficient instantiation strategy based on compression functions.
Arroyo
发表于 2025-3-28 11:44:01
http://reply.papertrans.cn/25/2406/240565/240565_40.png