Titlebook: Cryptography and Coding; 12th IMA Internation Matthew G. Parker Conference proceedings 2009 Springer-Verlag Berlin Heidelberg 2009 Code.DES

Harding

書目名稱Cryptography and Coding影響因子(影響力)




書目名稱Cryptography and Coding影響因子(影響力)學(xué)科排名




書目名稱Cryptography and Coding網(wǎng)絡(luò)公開度




書目名稱Cryptography and Coding網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Cryptography and Coding被引頻次




書目名稱Cryptography and Coding被引頻次學(xué)科排名




書目名稱Cryptography and Coding年度引用




書目名稱Cryptography and Coding年度引用學(xué)科排名




書目名稱Cryptography and Coding讀者反饋




書目名稱Cryptography and Coding讀者反饋學(xué)科排名

FRET

cinder

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

委托

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

雜色

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

雜色

Countermand

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

未成熟

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

紡織品

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