標(biāo)題: Titlebook: Coding, Cryptography and Combinatorics; Keqin Feng,Harald Niederreiter,Chaoping Xing Conference proceedings 2004 Springer Basel AG 2004 DE [打印本頁(yè)] 作者: patch-test 時(shí)間: 2025-3-21 16:27
書目名稱Coding, Cryptography and Combinatorics影響因子(影響力)
書目名稱Coding, Cryptography and Combinatorics影響因子(影響力)學(xué)科排名
書目名稱Coding, Cryptography and Combinatorics網(wǎng)絡(luò)公開度
書目名稱Coding, Cryptography and Combinatorics網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Coding, Cryptography and Combinatorics被引頻次
書目名稱Coding, Cryptography and Combinatorics被引頻次學(xué)科排名
書目名稱Coding, Cryptography and Combinatorics年度引用
書目名稱Coding, Cryptography and Combinatorics年度引用學(xué)科排名
書目名稱Coding, Cryptography and Combinatorics讀者反饋
書目名稱Coding, Cryptography and Combinatorics讀者反饋學(xué)科排名
作者: disrupt 時(shí)間: 2025-3-22 00:16
Modularity of Asymptotically Optimal Towers of Function Fields elliptic modular curves, Shimura curves, or Drinfeld modular curves by appropriate reduction. In this paper we review the recursive asymptotically optimal towers constructed so far, discuss the reasons behind Elkies’ conjecture, present numerical evidence of this conjecture, and sketch Elkies’ proo作者: 柔軟 時(shí)間: 2025-3-22 03:35
A New Correlation Attack on LFSR Sequences with High Error Tolerance) be . bits of observed sequence such that .(.. = ..)=1/2 + δ where .. This paper presents a new efficient correlation attack on stream ciphers, which is equivalent to solve the problem of recovering the LFSR’s initial state (. = (.., ..,…,..)from the observed output sequence z. We consider the prob作者: EXUDE 時(shí)間: 2025-3-22 05:58 作者: Lumbar-Stenosis 時(shí)間: 2025-3-22 12:46 作者: dura-mater 時(shí)間: 2025-3-22 16:30
The Capacity Region of Broadcast Networks with Two Receiversf the minimal cut that separates the source and the sink. Recently, it has been shown that if the intermediate nodes in the network are allowed to code the information that they receive, then the source . can multicast common information to several sinks at a rate that does not exceed the min-cut be作者: dura-mater 時(shí)間: 2025-3-22 17:10
On the Propagation Criterion of Boolean Functions the propagation criterion of high degree were given by Preneel et al., but their algebraic degree is too small for a cryptograhic use. Then designing Boolean functions of high algebraic degree and high degree of propagation has been the goal of several papers. In this paper, we investigate the work作者: 慢跑 時(shí)間: 2025-3-23 00:54
A Polly Cracker System Based on Satisfiability describe the construction of an instance of our system – which is a modified Polly Cracker scheme – starting from such a 3-SAT formula. Then we discuss security issues: this is achieved on the one hand by exploring best methods to date for solving this particular problem, and on the other hand by s作者: SLUMP 時(shí)間: 2025-3-23 03:37
Combinatorially Designed LDPC Codes Using Zech Logarithms and Congruential Sequencesposed (γ,ρ) regular LDPC ensemble has rate . girth ≥2., and exists for all γ≥2. The codes are a subset of Gallager’s random ensemble, but contains a good combination ofstructure and (pseudo)randomness. In particular, the simple case of γ=2 results in a class of codes that are high-rate, systematic, 作者: 火光在搖曳 時(shí)間: 2025-3-23 09:24 作者: 流浪 時(shí)間: 2025-3-23 10:00
HFE and BDDs: A Practical Attempt at Cryptanalysis chosen parameters during the construction produce a system of quadratic multivariate polynomials over . as the public key. An enclosed trapdoor is used to decrypt messages. We propose a ciphertext-only attack which mainly consists in satisfying a boolean formula. Our algorithm is based on BDDs (Bin作者: adj憂郁的 時(shí)間: 2025-3-23 15:18
Digital Nets and Coding Theoryviewed as the problem of constructing good linear codes in metric spaces that are more general than Hamming spaces. In this paper we report on the fascinating connections between digital nets and linear codes. In particular, we describe the duality theory for digital nets, the asymptotics of digital作者: insurrection 時(shí)間: 2025-3-23 21:23 作者: 控訴 時(shí)間: 2025-3-23 23:09 作者: 木訥 時(shí)間: 2025-3-24 02:50 作者: Compatriot 時(shí)間: 2025-3-24 09:33 作者: jocular 時(shí)間: 2025-3-24 13:34
https://doi.org/10.1007/978-3-642-68049-6In this paper, based on residue rings of polynomials, we present a general construction for nonbinary codes capable of correcting . or fewer symmetric errors and detecting all unidirectional errors with the magnitude error criterion. Some new lower bounds for such codes are obtained from this general construction.作者: cortex 時(shí)間: 2025-3-24 18:55
H. G. Willert,G. Buchhorn,L. ZichnerWe study the number of solutions to certain equations over finite fields and show how this gives a family of four-valued cross-correlation functions of binary m-sequences. This new family includes both of the four-valued cross-correlations found by Niho.作者: 陳舊 時(shí)間: 2025-3-24 19:13 作者: ventilate 時(shí)間: 2025-3-25 02:56 作者: 上坡 時(shí)間: 2025-3-25 04:03
Constructions of Nonbinary Codes Correcting ,-Symmetric Errors and Detecting All Unidirectional ErroIn this paper, based on residue rings of polynomials, we present a general construction for nonbinary codes capable of correcting . or fewer symmetric errors and detecting all unidirectional errors with the magnitude error criterion. Some new lower bounds for such codes are obtained from this general construction.作者: abysmal 時(shí)間: 2025-3-25 09:28
On Certain Equations over Finite Fields and Cross-Correlations of m-SequencesWe study the number of solutions to certain equations over finite fields and show how this gives a family of four-valued cross-correlation functions of binary m-sequences. This new family includes both of the four-valued cross-correlations found by Niho.作者: 預(yù)兆好 時(shí)間: 2025-3-25 13:49
New Constructions of Constant-Weight CodesBy generalizing a propagation rule for binary constant-weight codes, we present three constructions of binary constant-weight codes. It turns out that our constructions produce binary constant-weight codes with good parameters.作者: 安撫 時(shí)間: 2025-3-25 19:27 作者: encyclopedia 時(shí)間: 2025-3-25 22:40 作者: 特征 時(shí)間: 2025-3-26 00:55
https://doi.org/10.1007/978-3-642-88157-2 elliptic modular curves, Shimura curves, or Drinfeld modular curves by appropriate reduction. In this paper we review the recursive asymptotically optimal towers constructed so far, discuss the reasons behind Elkies’ conjecture, present numerical evidence of this conjecture, and sketch Elkies’ proo作者: laceration 時(shí)間: 2025-3-26 05:33 作者: constitute 時(shí)間: 2025-3-26 08:35 作者: prolate 時(shí)間: 2025-3-26 13:59 作者: ATOPY 時(shí)間: 2025-3-26 18:11 作者: Fatten 時(shí)間: 2025-3-26 21:52 作者: spondylosis 時(shí)間: 2025-3-27 04:08
Ale? Jakli?,Ale? Leonardis,Franc Solina describe the construction of an instance of our system – which is a modified Polly Cracker scheme – starting from such a 3-SAT formula. Then we discuss security issues: this is achieved on the one hand by exploring best methods to date for solving this particular problem, and on the other hand by s作者: 清唱?jiǎng)?nbsp; 時(shí)間: 2025-3-27 05:22
Ale? Jakli?,Ale? Leonardis,Franc Solinaposed (γ,ρ) regular LDPC ensemble has rate . girth ≥2., and exists for all γ≥2. The codes are a subset of Gallager’s random ensemble, but contains a good combination ofstructure and (pseudo)randomness. In particular, the simple case of γ=2 results in a class of codes that are high-rate, systematic, 作者: BROW 時(shí)間: 2025-3-27 12:57 作者: 施魔法 時(shí)間: 2025-3-27 15:16 作者: 高調(diào) 時(shí)間: 2025-3-27 18:51
Segmentation Using Two-Step Cluster Analysisviewed as the problem of constructing good linear codes in metric spaces that are more general than Hamming spaces. In this paper we report on the fascinating connections between digital nets and linear codes. In particular, we describe the duality theory for digital nets, the asymptotics of digital作者: Etching 時(shí)間: 2025-3-27 23:53 作者: notification 時(shí)間: 2025-3-28 03:35
Progress in Computer Science and Applied Logichttp://image.papertrans.cn/c/image/228913.jpg作者: 天賦 時(shí)間: 2025-3-28 09:02
Coding, Cryptography and Combinatorics978-3-0348-7865-4Series ISSN 2297-0576 Series E-ISSN 2297-0584 作者: Bumble 時(shí)間: 2025-3-28 13:16
https://doi.org/10.1007/978-3-642-88157-2 elliptic modular curves, Shimura curves, or Drinfeld modular curves by appropriate reduction. In this paper we review the recursive asymptotically optimal towers constructed so far, discuss the reasons behind Elkies’ conjecture, present numerical evidence of this conjecture, and sketch Elkies’ proof of modularity of the new families.作者: Self-Help-Group 時(shí)間: 2025-3-28 15:23
Segmentation in Social Marketingtained by changing . or fewer terms of the sequence per period. For the case that . is an odd prime,and . is a primitive root modulo p., we show a relationship between the linear complexity and the minimum value of . for which the k-error linear complexity is strictly less than the linear complexity.作者: 堅(jiān)毅 時(shí)間: 2025-3-28 19:43 作者: modest 時(shí)間: 2025-3-28 23:45
2297-0576 elected and all abstracts of contributed talks had been screened by the program committee. Thus, it was de- cided to call on all invited speakers and presenters of accepted contributed talks to submit their manuscripts for publication in the present v978-3-0348-9602-3978-3-0348-7865-4Series ISSN 2297-0576 Series E-ISSN 2297-0584 作者: A精確的 時(shí)間: 2025-3-29 05:14
On the Secondary Constructions of Resilient and Bent Functions作者: adjacent 時(shí)間: 2025-3-29 08:34
,Segmentabschlüsse in Konzernen, and lower complexity than other reported methods. Thirdly, we find a new formula to describe the relationship between the tendency of attack performance, the weight w of parity check equations, the noise level (δ, and ..作者: Chronological 時(shí)間: 2025-3-29 13:48 作者: Femish 時(shí)間: 2025-3-29 16:23 作者: 場(chǎng)所 時(shí)間: 2025-3-29 19:56 作者: 聯(lián)想 時(shí)間: 2025-3-30 02:50
2297-0576 ating connections between cod- ing theory, cryptology, and combinatorics. Therefore it seemed desirable to us to organize a conference that brings together experts from these three areas for a fruitful exchange of ideas. We decided on a venue in the Huang Shan (Yellow Mountain) region, one of the mo作者: grenade 時(shí)間: 2025-3-30 08:03
https://doi.org/10.1007/978-3-642-88157-2tion decomposition is adopted as the basis of recursion, and a new sufficient condition that a currently best candidate is the optimum at the current level of recursion is used as an early termination condition of the recursion. Preliminary simulation results for the (128, 64) Reed-Muller code are presented.作者: 賭博 時(shí)間: 2025-3-30 11:33
Idiopathic Necrosis of the Femoral Head,linear equations derived from the linearization equations for a given ciphertext,we can find the plaintext by an iteration of the procedure of first search for linear equations by linear combinations and then linear substitution. The computational complexity of the attack on these two schemes is less than 2. over a finite field of size 2..作者: tic-douloureux 時(shí)間: 2025-3-30 15:09
Ale? Jakli?,Ale? Leonardis,Franc Solinass security issues: this is achieved on the one hand by exploring best methods to date for solving this particular problem, and on the other hand by studying (systems of multivariate) polynomial equation solving algorithms in this particular setting. The main feature of our system is the resistance to intelligent linear algebra attacks.作者: 消散 時(shí)間: 2025-3-30 18:35 作者: lymphedema 時(shí)間: 2025-3-30 21:31 作者: 經(jīng)典 時(shí)間: 2025-3-31 01:24 作者: Intervention 時(shí)間: 2025-3-31 06:52 作者: BLANC 時(shí)間: 2025-3-31 10:31
Digital Nets and Coding Theorycinating connections between digital nets and linear codes. In particular, we describe the duality theory for digital nets, the asymptotics of digital-net parameters, and the new concept of cyclic digital nets.作者: 去世 時(shí)間: 2025-3-31 15:46 作者: sigmoid-colon 時(shí)間: 2025-3-31 19:57
Progress in Orthopaedic Surgerytween the source and any of the individual sinks. In this paper we find the achievable rate region when there are two receiver nodes t. and t., but we allow both common information at rate Ro and private information rates to t. and t2 at rates R1, R2, respectively.作者: fatty-acids 時(shí)間: 2025-3-31 23:03 作者: 不利 時(shí)間: 2025-4-1 02:19
https://doi.org/10.1007/978-981-10-1835-0devoted to some experimental results we obtained while trying to solve the Patarin’s challenge. This approach was not successful, nevertheless it provided some interesting information about the security of HFE cryptosystem.作者: choroid 時(shí)間: 2025-4-1 07:27
