標(biāo)題: Titlebook: Cryptography and Coding; 9th IMA Internationa Kenneth G. Paterson Conference proceedings 2003 Springer-Verlag Berlin Heidelberg 2003 authen [打印本頁(yè)] 作者: 類屬 時(shí)間: 2025-3-21 17:35
書目名稱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é)科排名
作者: Affiliation 時(shí)間: 2025-3-21 23:31 作者: 公共汽車 時(shí)間: 2025-3-22 04:09
A Designer’s Guide to KEMssumptions about the security of the underlying trapdoor function. Hence we propose two new, simple methods for constructing a KEM where the security of the KEM is based on weak assumptions about the underlying function. Lastly we propose a new KEM based on the Rabin function that is both efficient a作者: FER 時(shí)間: 2025-3-22 08:20
Wearable Transdermal Biosensorshat they often provide a good trade-o. between error-control power and complexity of decoding. The rate of a random error-control block array code, such as a product code, for example (classical product codes form a sub-class of array codes), is usually less than that of the best available alternati作者: 防水 時(shí)間: 2025-3-22 08:58
The Reality for Women Scholars,cream, Turing, Rabbit, Helix, and many more, are very far from classical designs like nonlinear filter generators, nonlinear combination generators, etc. One major difference is that classical designs are bit-oriented, whereas modern designs tend to operate on (e.g. 32 bit) words to provide efficien作者: 假設(shè) 時(shí)間: 2025-3-22 14:41 作者: 假設(shè) 時(shí)間: 2025-3-22 19:56 作者: 燒瓶 時(shí)間: 2025-3-22 22:40 作者: Etching 時(shí)間: 2025-3-23 04:45
Conference proceedings 2003mittee who aided me - mensely by evaluating the submissions, providing detailed written feedback for the authors of many of the papers, and advising me at many critical points - ring the process. Their help and cooperation was essential, especially in view of the short amount of time available to co作者: Orchiectomy 時(shí)間: 2025-3-23 06:40
0302-9743 ultural College, Cirencester, from 16–18 Dec- ber 2003. The conference’s varied programme of 4 invited and 25 contributed papers is represented in this volume. The contributed papers were selected from the 49 submissions using a - reful refereeing process. The contributed and invited papers are grou作者: instulate 時(shí)間: 2025-3-23 13:30 作者: cravat 時(shí)間: 2025-3-23 15:32
Kumari Namrata,R. P. Saini,D. P. Kothariial and policy work with my GCHQ career culminating as Director of CESG from 1999 to 2002. During that time I have had ample opportunity to observe the evolution of cryptography as an academic discipline and also as a practical science (the two are often very different).作者: 閑蕩 時(shí)間: 2025-3-23 21:11 作者: moratorium 時(shí)間: 2025-3-24 00:24 作者: Vulvodynia 時(shí)間: 2025-3-24 02:28 作者: hankering 時(shí)間: 2025-3-24 08:19 作者: Brain-Imaging 時(shí)間: 2025-3-24 12:00 作者: 顯而易見 時(shí)間: 2025-3-24 18:51
Estimates for Discrete Logarithm Computations in Finite Fields of Small Characteristiclied upon in an asymptotic analysis. We also give evidence that for any fixed field size some may be weaker than others of a different characteristic or field representation, and compare the relative difficulty of computing discrete logarithms via the FFS in such cases.作者: right-atrium 時(shí)間: 2025-3-24 22:45 作者: 微粒 時(shí)間: 2025-3-25 02:09
Data Hiding Techniques in Windows,ber theory to extend the class of period lengths . and the number of admissible errors . for which this conjecture fails for rather large values of .. We also discuss the relevance of this result for stream ciphers.作者: HPA533 時(shí)間: 2025-3-25 07:20 作者: Glaci冰 時(shí)間: 2025-3-25 07:41
The Reality for Women Scholars,ore the nonlinearity of such a function in many cases is superior to all previously known construction methods. This construction method is then generalized to the case of vectorial resilient functions, that is {F} : .?., providing functions of very high algebraic degree almost reaching the Siegenthaler’s upper bound.作者: Obsequious 時(shí)間: 2025-3-25 14:28 作者: OWL 時(shí)間: 2025-3-25 17:20
Degree Optimized Resilient Boolean Functions from Maiorana-McFarland Classore the nonlinearity of such a function in many cases is superior to all previously known construction methods. This construction method is then generalized to the case of vectorial resilient functions, that is {F} : .?., providing functions of very high algebraic degree almost reaching the Siegenthaler’s upper bound.作者: 適宜 時(shí)間: 2025-3-26 00:03
Commitment Capacity of Discrete Memoryless Channelsuction, this result provides a lower bound on the channel’s capacity for implementing coin tossing..The method of proving this relates the problem to Wyner’s wire–tap channel in an amusing way. There is also an extension to quantum channels.作者: Employee 時(shí)間: 2025-3-26 02:35 作者: 組成 時(shí)間: 2025-3-26 08:18
Conference proceedings 2003c- ber 2003. The conference’s varied programme of 4 invited and 25 contributed papers is represented in this volume. The contributed papers were selected from the 49 submissions using a - reful refereeing process. The contributed and invited papers are grouped into 5 topics: coding and applications;作者: 破裂 時(shí)間: 2025-3-26 11:02
Cavitas Biosensors (Body Cavity Sensors)?1)?+?2.??1)/(.(2.?+?2)?+?2.), . ≥ 2, codes with .. ≥ 3 and any code degree. An efficient exhaustive search algorithm is outlined as well. A computer search was carried out, and several codes having larger . than codes in the literature were found.作者: Phagocytes 時(shí)間: 2025-3-26 13:36 作者: 厭惡 時(shí)間: 2025-3-26 19:02 作者: 表示向下 時(shí)間: 2025-3-26 21:30
The Reality for Women Scholars,as typically been around .=1/2.. Our algorithm has low computational complexity and is able to use code rates around .=1/2.. This way we get much more information about the key bits. Furthermore, the run time for a successful attack is reduced significantly and we need fewer key stream bits.作者: 免費(fèi) 時(shí)間: 2025-3-27 02:27
Nnenesi A. Kgabi,Hilma R. Amwelen the sets ., .=0,1,2 is .. Second, we show that the covering radius of the binary Reed-Muller code .(2,7) in the set . is .. We derive a new lower bound for the covering radius of the Reed-Muller code .(2,.) in the set .. Finally, we present new lower bounds in the sets ., .=0,1,2.作者: 燒瓶 時(shí)間: 2025-3-27 08:17 作者: defeatist 時(shí)間: 2025-3-27 11:10 作者: angina-pectoris 時(shí)間: 2025-3-27 15:54
Cavitas Biosensors (Body Cavity Sensors)y the number of edges is the average cycle weight per edge. Let .. denote the . over all cycles in a minimal state diagram of a convolutional code, excluding the all-zero cycle around the all-zero state. For comparison between codes of different parameters, let . This work investigates high rate con作者: Chronic 時(shí)間: 2025-3-27 20:55 作者: growth-factor 時(shí)間: 2025-3-27 22:27
Masumi Yamaguchi,Hiroyoshi Togo at which a discrete memoryless channel can be used to for bit commitment. It turns out that the answer is very intuitive: it is the maximum equivocation of the channel (after removing trivial redundancy), even when unlimited noiseless bidirectional side communication is allowed. By a well–known red作者: 價(jià)值在貶值 時(shí)間: 2025-3-28 03:11 作者: 杠桿支點(diǎn) 時(shí)間: 2025-3-28 09:35
The Reality for Women Scholars,as typically been around .=1/2.. Our algorithm has low computational complexity and is able to use code rates around .=1/2.. This way we get much more information about the key bits. Furthermore, the run time for a successful attack is reduced significantly and we need fewer key stream bits.作者: Constant 時(shí)間: 2025-3-28 11:41
Nnenesi A. Kgabi,Hilma R. Amwelen the sets ., .=0,1,2 is .. Second, we show that the covering radius of the binary Reed-Muller code .(2,7) in the set . is .. We derive a new lower bound for the covering radius of the Reed-Muller code .(2,.) in the set .. Finally, we present new lower bounds in the sets ., .=0,1,2.作者: 系列 時(shí)間: 2025-3-28 15:32
The Reality for Women Scholars,ruction method valid for any . ≥ 4 and for order of resiliency . satisfying . ≤ .-3. The construction is based on the modification of the famous Marioana-McFarland class in a controlled manner such that the resulting functions will contain some extra terms of high algebraic degree in its ANF includi作者: Phenothiazines 時(shí)間: 2025-3-28 22:41 作者: sundowning 時(shí)間: 2025-3-28 23:49 作者: 煤渣 時(shí)間: 2025-3-29 04:28 作者: Evacuate 時(shí)間: 2025-3-29 09:29
Windows Registry Forensics Part 1,silient signature scheme. We propose efficient key updating signature schemes based on a secure identity-based signature (IBS) scheme. KUS-SKI is a strong (.-1, .) key-insulated signature scheme with random-access key updates, and KUS-IR is a Type (I) intrusion-resilient signature scheme. We also pr作者: 學(xué)術(shù)討論會(huì) 時(shí)間: 2025-3-29 14:07 作者: 舞蹈編排 時(shí)間: 2025-3-29 18:32 作者: 不持續(xù)就爆 時(shí)間: 2025-3-29 20:28 作者: landmark 時(shí)間: 2025-3-30 02:00
https://doi.org/10.1007/b93924authentication; coding; coding theory; communications; cryptographic attacks; cryptography; cryptology; dec作者: magnanimity 時(shí)間: 2025-3-30 06:40
978-3-540-20663-7Springer-Verlag Berlin Heidelberg 2003作者: 龍蝦 時(shí)間: 2025-3-30 08:17
Improved Fast Correlation Attack Using Low Rate Codesas typically been around .=1/2.. Our algorithm has low computational complexity and is able to use code rates around .=1/2.. This way we get much more information about the key bits. Furthermore, the run time for a successful attack is reduced significantly and we need fewer key stream bits.作者: BRAVE 時(shí)間: 2025-3-30 15:22 作者: chemical-peel 時(shí)間: 2025-3-30 19:50 作者: Processes 時(shí)間: 2025-3-30 20:45 作者: 放縱 時(shí)間: 2025-3-31 04:48
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/240569.jpg作者: TOXIN 時(shí)間: 2025-3-31 07:13
The Reality for Women Scholars,Separating codes have recently been applied in the construction of collusion secure fingerprinting schemes. They are related to other combinatorial concepts like intersecting codes, superimposed codes, hashing families, and group testing. In this paper we study some good, binary asymptotic constructions of such codes.作者: excursion 時(shí)間: 2025-3-31 12:18
Windows Registry Forensics Part 2,We propose a general construction for public key encryption schemes that are IND-CCA2 secure in the random oracle model. We show that the scheme proposed in [1,2] fits our general framework and moreover that our method of analysis leads to a more efficient security reduction.作者: 蘑菇 時(shí)間: 2025-3-31 17:04 作者: 情節(jié)劇 時(shí)間: 2025-3-31 20:17
Separating and Intersecting Properties of BCH and Kasami CodesSeparating codes have recently been applied in the construction of collusion secure fingerprinting schemes. They are related to other combinatorial concepts like intersecting codes, superimposed codes, hashing families, and group testing. In this paper we study some good, binary asymptotic constructions of such codes.作者: CBC471 時(shí)間: 2025-4-1 01:43
A General Construction of IND-CCA2 Secure Public Key EncryptionWe propose a general construction for public key encryption schemes that are IND-CCA2 secure in the random oracle model. We show that the scheme proposed in [1,2] fits our general framework and moreover that our method of analysis leads to a more efficient security reduction.作者: Armada 時(shí)間: 2025-4-1 03:34
Computing the , = , , Integer Matrix DecompositionThe cryptanalysis of Gentry and Szydlo of the revised NTRU signature scheme requires the computation of the integer matrix decomposition . = ... We propose a heuristic algorithm to compute this decomposition and investigate its properties. Our test implementation of this algorithm in Magma is able to deal with matrices up to 158 rows and columns.作者: allergy 時(shí)間: 2025-4-1 07:03
Recent Developments in Array Error-Control Codesof information symbols arranged in two or more dimensions. The check symbols are calculated by taking sums of the the information symbols lying along rows, columns, diagonals or other directions or paths in the information array. The simplest array code is the binary block code obtained by taking si作者: Intend 時(shí)間: 2025-4-1 10:49 作者: thrombosis 時(shí)間: 2025-4-1 15:12
A Multifunctional Turbo-Based Receiver Using Partial Unit Memory Codesrequency-selective channels with fading. The turbo codes are based on Partial Unit Memory Codes, which may be constructed with higher free distance than equivalent recursive systematic convolutional codes and can achieve better performance than the latter. The purely digital multifunctional receiver作者: Isthmus 時(shí)間: 2025-4-1 22:11
Commitment Capacity of Discrete Memoryless Channels at which a discrete memoryless channel can be used to for bit commitment. It turns out that the answer is very intuitive: it is the maximum equivocation of the channel (after removing trivial redundancy), even when unlimited noiseless bidirectional side communication is allowed. By a well–known red作者: lambaste 時(shí)間: 2025-4-2 01:06
