Titlebook: Coding and Cryptology; Third International Yeow Meng Chee,Zhenbo Guo,Chaoping Xing Conference proceedings 2011 Springer Berlin Heidelberg

panache

书目名称Coding and Cryptology影响因子(影响力)




书目名称Coding and Cryptology影响因子(影响力)学科排名




书目名称Coding and Cryptology网络公开度




书目名称Coding and Cryptology网络公开度学科排名




书目名称Coding and Cryptology被引频次




书目名称Coding and Cryptology被引频次学科排名




书目名称Coding and Cryptology年度引用




书目名称Coding and Cryptology年度引用学科排名




书目名称Coding and Cryptology读者反馈




书目名称Coding and Cryptology读者反馈学科排名

Insensate

Secret-Sharing Schemes: A Survey,ecret. Secret-sharing schemes are an important tool in cryptography and they are used as a building box in many secure protocols, e.g., general protocol for multiparty computation, Byzantine agreement, threshold cryptography, access control, attribute-based encryption, and generalized oblivious tran

高谈阔论

制定

List Decoding for Binary Goppa Codes,, approximately . errors in a length-. classical irreducible degree-. binary Goppa code. Compared to the best previous polynomial-time list-decoding algorithms for the same codes, the new algorithm corrects approximately . extra errors.

antipsychotic

Faster 2-Regular Information-Set Decoding,. length-. blocks, each of which has Hamming weight 0 or 2. This problem appears in attacks on the FSB (fast syndrome-based) hash function and related proposals. This problem differs from the usual information-set-decoding problems in that (1) the target codeword is required to have a very regular s

Abjure

Ideal Secret Sharing Schemes for Useful Multipartite Access Structures, the construction of ideal linear secret sharing schemes for access structures that are natural generalizations of the threshold ones and have interesting properties for the applications. Some of them have hierarchical properties, while other ones are suitable for situations requiring the agreement

Abjure

Unsaturated-Fat

faction

Algorithms for the Shortest and Closest Lattice Vector Problems,f algorithms for these problems, namely the algorithm by Micciancio and Voulgaris based on the Voronoi cell [STOC’10], the Monte-Carlo algorithms derived from the Ajtai, Kumar and Sivakumar algorithm [STOC’01] and the enumeration algorithms originally elaborated by Kannan [STOC’83] and Fincke and Po

丰富

An Experiment of Number Field Sieve over GF(,) of Low Hamming Weight Characteristic,LP) over prime field GF(.), and thus it is important to evaluate the difficulty of the DLP over GF(.) for discussing the security of these protocols. The number field sieve (NFS) is asymptotically the fastest algorithm to solve the DLP over GF(.). NFS was first proposed by Gordon and then it was imp