標(biāo)題: Titlebook: Coding and Cryptology; Second International Yeow Meng Chee,Chao Li,Chaoping Xing Conference proceedings 2009 Springer-Verlag Berlin Heidelb [打印本頁] 作者: 我在爭斗志 時間: 2025-3-21 17:22
書目名稱Coding and Cryptology影響因子(影響力)
書目名稱Coding and Cryptology影響因子(影響力)學(xué)科排名
書目名稱Coding and Cryptology網(wǎng)絡(luò)公開度
書目名稱Coding and Cryptology網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Coding and Cryptology被引頻次
書目名稱Coding and Cryptology被引頻次學(xué)科排名
書目名稱Coding and Cryptology年度引用
書目名稱Coding and Cryptology年度引用學(xué)科排名
書目名稱Coding and Cryptology讀者反饋
書目名稱Coding and Cryptology讀者反饋學(xué)科排名
作者: 兇兆 時間: 2025-3-21 21:54
https://doi.org/10.1007/b138397e arising from the Paley graphs and tournaments. Computational results on arrays generated by column translation, such as the Paley graphs, lead to substantial improvements on known existence results for binary covering arrays of strengths four and five.作者: 無聊的人 時間: 2025-3-22 03:08 作者: Water-Brash 時間: 2025-3-22 06:50
https://doi.org/10.1007/978-3-030-15374-8 number of such curves for which both the curve and its twist have a number of points which is prime. In a work in progress theoretical extimates are obtained wherein the number of such points on both curves has a prescribed arithmetic structure.作者: 組裝 時間: 2025-3-22 10:52
Christine Strothotte,Thomas Strothotteinator is also discussed..The second concerns an infinite family of .-regular bipartite graphs with large girth constructed in [8]. The LDPC codes based on these graphs have attracted much attention. We show that the first few of these graphs are Ramanujan graphs.作者: ordain 時間: 2025-3-22 13:21 作者: ordain 時間: 2025-3-22 18:14
Binary Covering Arrays and Existentially Closed Graphs,e arising from the Paley graphs and tournaments. Computational results on arrays generated by column translation, such as the Paley graphs, lead to substantial improvements on known existence results for binary covering arrays of strengths four and five.作者: Constant 時間: 2025-3-23 00:08 作者: 盤旋 時間: 2025-3-23 04:17 作者: Amorous 時間: 2025-3-23 06:55 作者: thrombus 時間: 2025-3-23 13:45 作者: 抗原 時間: 2025-3-23 17:10 作者: 變白 時間: 2025-3-23 21:27 作者: absolve 時間: 2025-3-23 22:58 作者: Inelasticity 時間: 2025-3-24 04:06
Seeing Christ in Australia: Introduction,mitation of the usage of the Maiorana-McFarland type bent functions, and the necessity to study the existence of bent functions with special property which we call partial symmetric. At last, we give some results on the nonexistence of some partial symmetric bent functions.作者: 拉開這車床 時間: 2025-3-24 07:24
https://doi.org/10.1007/978-3-031-65679-8s, impersonation attack and substitution attack. We derive lower bounds on an opponent’s deception probability in these attacks under the assumption that all keys are equiprobable. Our bounds generalize known combinatorial bounds in classical authentication theory.作者: 擔(dān)憂 時間: 2025-3-24 11:33
Minimum Distance between Bent and Resilient Boolean Functions,mitation of the usage of the Maiorana-McFarland type bent functions, and the necessity to study the existence of bent functions with special property which we call partial symmetric. At last, we give some results on the nonexistence of some partial symmetric bent functions.作者: 看法等 時間: 2025-3-24 17:44
Unconditionally Secure Approximate Message Authentication,s, impersonation attack and substitution attack. We derive lower bounds on an opponent’s deception probability in these attacks under the assumption that all keys are equiprobable. Our bounds generalize known combinatorial bounds in classical authentication theory.作者: Cursory 時間: 2025-3-24 21:01
Conference proceedings 2009n June 2009. The 21 revised full technical papers, except one, are contributed by the invited speakers of the workshop. The papers were carefully selected during two rounds of reviewing and improvement for inclusion in the volume and address all aspects of coding theory, cryptology and related areas作者: Flinch 時間: 2025-3-24 23:58
A New Client-to-Client Password-Authenticated Key Agreement Protocol,nst . attack and the claim of provable security is seriously incorrect. To draw lessons from these results, we revealed fatal flaws in Byun et al.’s security model and their proof of security. Then, we modify formal security model and corresponding security definitions. In addition, a new . C2C-PAKA protocol is presented with security proof.作者: 緩和 時間: 2025-3-25 07:00 作者: somnambulism 時間: 2025-3-25 09:46 作者: 看法等 時間: 2025-3-25 13:27 作者: 拋棄的貨物 時間: 2025-3-25 17:06
0302-9743 ated areas - such as combinatorics - theoretical or applied. Topics addressed are coding theory, secure codes, hash functions, combinatorics, boolean functions, authentication, cryptography, protocols, sequences, and secure communications.978-3-642-01813-8978-3-642-01877-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: indoctrinate 時間: 2025-3-25 20:38 作者: 外觀 時間: 2025-3-26 03:12 作者: Entirety 時間: 2025-3-26 05:10
https://doi.org/10.1007/b138397rength larger than three remains poorly understood. Connections with existentially closed graphs and Hadamard matrices are examined, particularly those arising from the Paley graphs and tournaments. Computational results on arrays generated by column translation, such as the Paley graphs, lead to su作者: SPER 時間: 2025-3-26 08:53
https://doi.org/10.1007/b138397considered along with a new efficient decoding algorithm. The design substantially increases the code rates of the former fingerprinting constructions. In particular, for large ., the new .-fingerprinting codes have code rate of ..ln 2 and identify a pirate with an error probability that declines ex作者: Commemorate 時間: 2025-3-26 14:12
https://doi.org/10.1007/b138397us applications in information theory. Recently, two-dimensional synchronization patterns have found application in key predistribution for wireless sensor networks. This application has raised some new questions. We will discuss some of the old and new questions in this area. We will describe sever作者: PLAYS 時間: 2025-3-26 17:47 作者: Rustproof 時間: 2025-3-26 23:12 作者: 煤渣 時間: 2025-3-27 04:45 作者: GLUE 時間: 2025-3-27 07:07 作者: 樹木心 時間: 2025-3-27 12:14
Christine Strothotte,Thomas Strothotte. Hardware implementation of a slightly modified version of the algorithm presented here runs at significantly faster speeds, namely at 2 Gbits/sec on an FPGA Virtex V of frequency 300 MHz. Modelling suggests that this speed can be increased to 3.4 Gbits/sec. Unlike most other existing hash algorith作者: intertwine 時間: 2025-3-27 16:37 作者: 準(zhǔn)則 時間: 2025-3-27 18:06
Seeing Christ in Australia Since 1850me encryption. The second one relates to computationally secure encryption resisting adaptive chosen ciphertext attacks in streaming mode with bounded resources: memory, time delay or output length. Curiously, both impossibility results can be achieved with either finite or continuous domains. The l作者: Urgency 時間: 2025-3-27 23:00
Seeing Christ in Australia: Introduction,x, which leads to a combinatorial problem; the other is the existence of bent functions with specified types. Then the relation of these two problems is studied. For the 1-resilient functions, we get a solution to the first combinatorial problem. By using this solution and the relation of the two pr作者: 拖債 時間: 2025-3-28 04:10
https://doi.org/10.1007/978-3-031-65679-8.′, .) where . is the calculated tag for a message . that is ‘close’ to .′ should pass the verification test. Fuzziness of plaintexts can be due to a variety of factors including applying acceptable transforms such as compression and decompression to data, or inaccuracy of sensors in reading biometr作者: Dorsal 時間: 2025-3-28 06:16 作者: 導(dǎo)師 時間: 2025-3-28 12:49
https://doi.org/10.1007/b138397In this paper, a class of three-weight linear codes and a class of four-weight linear codes over GF(.) are presented and their weight distributions are determined. These codes are punctured from the irreducible cyclic codes, and contain optimal codes. Their duals contain also optimal codes.作者: aphasia 時間: 2025-3-28 16:08 作者: fibula 時間: 2025-3-28 22:20 作者: Saline 時間: 2025-3-29 02:59 作者: FOVEA 時間: 2025-3-29 05:07 作者: Friction 時間: 2025-3-29 09:27 作者: pericardium 時間: 2025-3-29 13:05
A Class of Three-Weight and Four-Weight Codes,In this paper, a class of three-weight linear codes and a class of four-weight linear codes over GF(.) are presented and their weight distributions are determined. These codes are punctured from the irreducible cyclic codes, and contain optimal codes. Their duals contain also optimal codes.作者: 小歌劇 時間: 2025-3-29 18:04
Hunting for Curves with Many Points,We construct curves with many points over finite fields by using the class group.作者: 骨 時間: 2025-3-29 22:11
,List Decoding of Binary Codes–A Brief Survey of Some Recent Results,We briefly survey some recent progress on list decoding algorithms for . codes. The results discussed include:.We will only sketch the high level ideas behind these developments, pointing to the original papers for technical details and precise theorem statements.作者: SLAG 時間: 2025-3-30 03:30 作者: 不發(fā)音 時間: 2025-3-30 07:16
A Survey of Algebraic Unitary Codes,This survey paper gives an overview of algebraic unitary codes. It describes the coding problem involved, and present several algebraic approaches yielding interesting constructions, as well as the latest bounds.作者: 變異 時間: 2025-3-30 08:16
Coding and Cryptology978-3-642-01877-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Cholagogue 時間: 2025-3-30 13:19 作者: micturition 時間: 2025-3-30 16:44
https://doi.org/10.1007/b138397considered along with a new efficient decoding algorithm. The design substantially increases the code rates of the former fingerprinting constructions. In particular, for large ., the new .-fingerprinting codes have code rate of ..ln 2 and identify a pirate with an error probability that declines exponentially in code length ..作者: 鑒賞家 時間: 2025-3-30 22:19
Seeing Christ in Australia Since 1850.-fold perfect authentication codes for arbitrary positive integer .. In this paper it shows that the subfield rational normal curves provide a new family of such codes, its expected probabilities of successful deception for optimal spoofing attacks are less than those probabilities of former constructed codes in most cases.作者: 呼吸 時間: 2025-3-31 01:35
An Infinite Class of Balanced Vectorial Boolean Functions with Optimum Algebraic Immunity and Good d Yang. These functions provably achieve an optimum algebraic immunity. We give a simpler proof of this fact and we prove that these functions have also an optimum algebraic degree and a non-weak nonlinearity.作者: Obstacle 時間: 2025-3-31 07:48
Equal-Weight Fingerprinting Codes,considered along with a new efficient decoding algorithm. The design substantially increases the code rates of the former fingerprinting constructions. In particular, for large ., the new .-fingerprinting codes have code rate of ..ln 2 and identify a pirate with an error probability that declines exponentially in code length ..作者: Hemiplegia 時間: 2025-3-31 11:39 作者: 搖晃 時間: 2025-3-31 13:42 作者: 盡責(zé) 時間: 2025-3-31 20:36
978-3-642-01813-8Springer-Verlag Berlin Heidelberg 2009作者: IRK 時間: 2025-4-1 00:13
An Infinite Class of Balanced Vectorial Boolean Functions with Optimum Algebraic Immunity and Good d Yang. These functions provably achieve an optimum algebraic immunity. We give a simpler proof of this fact and we prove that these functions have also an optimum algebraic degree and a non-weak nonlinearity.作者: Custodian 時間: 2025-4-1 02:38
