Harding
发表于 2025-3-21 19:52:36
书目名称Cryptography and Coding影响因子(影响力)<br> http://impactfactor.cn/2024/if/?ISSN=BK0240570<br><br> <br><br>书目名称Cryptography and Coding影响因子(影响力)学科排名<br> http://impactfactor.cn/2024/ifr/?ISSN=BK0240570<br><br> <br><br>书目名称Cryptography and Coding网络公开度<br> http://impactfactor.cn/2024/at/?ISSN=BK0240570<br><br> <br><br>书目名称Cryptography and Coding网络公开度学科排名<br> http://impactfactor.cn/2024/atr/?ISSN=BK0240570<br><br> <br><br>书目名称Cryptography and Coding被引频次<br> http://impactfactor.cn/2024/tc/?ISSN=BK0240570<br><br> <br><br>书目名称Cryptography and Coding被引频次学科排名<br> http://impactfactor.cn/2024/tcr/?ISSN=BK0240570<br><br> <br><br>书目名称Cryptography and Coding年度引用<br> http://impactfactor.cn/2024/ii/?ISSN=BK0240570<br><br> <br><br>书目名称Cryptography and Coding年度引用学科排名<br> http://impactfactor.cn/2024/iir/?ISSN=BK0240570<br><br> <br><br>书目名称Cryptography and Coding读者反馈<br> http://impactfactor.cn/2024/5y/?ISSN=BK0240570<br><br> <br><br>书目名称Cryptography and Coding读者反馈学科排名<br> http://impactfactor.cn/2024/5yr/?ISSN=BK0240570<br><br> <br><br>
FRET
发表于 2025-3-21 22:43:23
http://reply.papertrans.cn/25/2406/240570/240570_2.png
cinder
发表于 2025-3-22 02:52:27
Codes as Modules over Skew Polynomial Ringsider codes defined as . over skew polynomial rings, removing therefore some of the constraints on the length of the skew codes defined as ideals. The notion of BCH codes can be extended to this new approach and the skew codes whose duals are also defined as modules can be characterized. We conjectur
委托
发表于 2025-3-22 06:01:20
On Higher Weights and Code Existenceen solved by studying possible weight enumerators. A couple of authors in this decade have proposed using higher weights (generalised Hamming weights) to a similar effect. In this paper we suggest one approach based on the weight hierarchy, and it allows us to conduct an extremely rapid computer sea
Malfunction
发表于 2025-3-22 12:38:35
http://reply.papertrans.cn/25/2406/240570/240570_5.png
杂色
发表于 2025-3-22 14:21:49
Bivium as a Mixed-Integer Linear Programming Problemarticle we present a numerical attack on the Biviums. The main idea is to transform the problem of solving a sparse system of quadratic equations over .(2) into a combinatorial optimization problem. We convert the Boolean equation system into an equation system over ℝ and formulate the problem of fi
杂色
发表于 2025-3-22 20:05:24
http://reply.papertrans.cn/25/2406/240570/240570_7.png
Countermand
发表于 2025-3-22 22:07:08
Another Glance at Double-Length Hashingr single-call hash functions. We focus on compression functions compressing 3. bits to 2. bits that use one or two calls to a 2.-bit key, .-bit block blockcipher. In case of a single call, we concentrate on security in the iteration. In case of two calls, we restrict ourselves to two parallel calls
未成熟
发表于 2025-3-23 03:44:55
Geometric Ideas for Cryptographic Equation Solving in Even Characteristicrd Groebner basis algorithm or an XL algorithm for certain multivariate equation systems. However, the GeometricXL algorithm as originally described is not well-suited to fields of even characteristic. This paper discusses adaptations of the GeometricXL algorithm to even characteristic, in which the
纺织品
发表于 2025-3-23 07:07:24
Provably Secure Code-Based Threshold Ring Signaturest revealing which subset of ring members actually produced the signature. A recent proposal of Aguillar . introduced the first code-based threshold ring signature scheme which large signatures (about 20KBytes per member of the ring for 80-bit security)..We propose a new code-based threshold ring sig