標(biāo)題: Titlebook: Cryptography and Coding; Fifth IMA Conference Colin Boyd Conference proceedings 1995 Springer-Verlag Berlin Heidelberg 1995 DES.Decodierung [打印本頁] 作者: finesse 時間: 2025-3-21 17:06
書目名稱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é)科排名
作者: 顯示 時間: 2025-3-21 20:36 作者: GUEER 時間: 2025-3-22 03:11
Sequential decoding for a subcode of Reed Solomon Codes, technique sequential decoding using a modified Fano algorithm has been attempted. An encoding technique for generating subcode is designed to enhance the performance and the computational efficiency of the decoder. The performance has been estimated on an AWGN channel. Sequential decoding performan作者: Torrid 時間: 2025-3-22 07:52 作者: 主動脈 時間: 2025-3-22 09:47
Minimal weight ,-SR representations,esentation of the design and proof of the algorithm. The performance of this new method is analysed and compared with previously proposed methods. The techniques presented in this paper have applications in speeding up the implementation of public-key cryptographic algorithms such as RSA [3].作者: FOIL 時間: 2025-3-22 16:01
Some decoding applications of minimal realization,BCH and Reed-Solomon codes, errors and erasures, classical Goppa codes and negacyclic codes. We concentrate on the . of the DFT of an error polynomial, thus avoiding the “key equation” and Forney‘s procedure. We also discuss simplification of the theory in characteristic two and an extension of the 作者: FOIL 時間: 2025-3-22 18:14 作者: dermatomyositis 時間: 2025-3-22 23:33 作者: 鞏固 時間: 2025-3-23 04:19 作者: INTER 時間: 2025-3-23 07:19 作者: Autobiography 時間: 2025-3-23 12:26
Quantum cryptography: Protecting our future networks with quantum mechanics,y on our communications networks. This technique, known as quantum cryptography, is the result of a synthesis of ideas from fundamental quantum physics and classical encryption. We review the developments in this rapidly-growing field.作者: 彎曲的人 時間: 2025-3-23 16:46
Prepaid electronic cheques using public-key certificates,ncy and low storage requirements for the tamper resistant smart card implementing the purse of the user. This is achieved using a counter-based solution in combination with public-key certificates that represent the electronic cheques. To simplify both the withdrawal and the deposit stage we renounc作者: 擴張 時間: 2025-3-23 18:22
,An elliptic curve analogue of McCurley’s key agreement scheme,ker must be able to break the ordinary Diffie-Hellman scheme and also factorise large numbers. This paper presents an analogue of McCurley‘s scheme using elliptic curves. A consequence is that a method to break ordinary Diffie-Hellman would not be applicable to our scheme. An advantage of our scheme作者: Self-Help-Group 時間: 2025-3-24 01:57 作者: acquisition 時間: 2025-3-24 04:09
0302-9743 5..The volume presents 22 full revised papers selected from 48 submissions together with five invited full papers and three abstracts on the mathematical theory and practice of cryptography and coding; continuing advances in these strongly related areas are crucial for the security and reliability o作者: Rodent 時間: 2025-3-24 08:54 作者: Antioxidant 時間: 2025-3-24 13:59
Peng Zhao the performance and the computational efficiency of the decoder. The performance has been estimated on an AWGN channel. Sequential decoding performance of the subcode of (15,11) RS code could produce a comparable performance as well as computational efficiency to Viterbi decoding of rate 1/2 convolutional code with constraint length 7.作者: 開頭 時間: 2025-3-24 16:45
Peng Zhaonction with a unique term of maximum order and for any maximal-length LFSR. To illustrate the power of this technique, we give some high lower bounds that confirm Rueppel‘s conclusion about the exponential growth of the linear complexity in filter generators.作者: Highbrow 時間: 2025-3-24 19:24 作者: 古董 時間: 2025-3-24 23:22
Peng Zhao. Then, a comprehensive description of various perfect sequences is given. The emphasis will be on the synthesis of different perfect sequences, including two-valued perfect sequences, ternary perfect sequences, polyphase perfect sequences and modulatable perfect sequences. The perfect array and other related topics are also discussed briefly.作者: Limousine 時間: 2025-3-25 06:06
Kitherian Sahayaraj,Errol Hassane formulated as binary codes in order to compare the two approaches. On the AWGN channel, the binary approach shows better performance for the same complexity than the multilevel approach and it appears that the Dorsch algorithm is not well suited to multilevel codes.作者: CODE 時間: 2025-3-25 09:38
Xianlin Liu,Jianming Wang,Yukuan Sunon in combination with public-key certificates that represent the electronic cheques. To simplify both the withdrawal and the deposit stage we renounce to provide the untraceability feature. Our payment system is built around the Guillou-Quisquater identification/signature scheme in an RSA-group.作者: 拍翅 時間: 2025-3-25 14:41 作者: FLACK 時間: 2025-3-25 17:14 作者: addition 時間: 2025-3-25 23:22
Good codes based on very sparse matrices,using a free energy minimization algorithm and a belief propagation algorithm for decoding, demonstrating practical performance superior to that of both Bose-Chaudhury-Hocquenghem codes and Reed-Muller codes over a wide range of noise levels.作者: seruting 時間: 2025-3-26 02:06
Design choices and security implications in implementing Diffie-Hellman key agreement, cryptography which offer adequate security while minimizing the computational requirements thereof, various options are available regarding parameter selection and other design choices. We examine a subset of options intended to reduce the computational costs of Diffie-Hellman key agreement protocols, and their related security implications.作者: 改正 時間: 2025-3-26 06:47
Sequential decoding for a subcode of Reed Solomon Codes, the performance and the computational efficiency of the decoder. The performance has been estimated on an AWGN channel. Sequential decoding performance of the subcode of (15,11) RS code could produce a comparable performance as well as computational efficiency to Viterbi decoding of rate 1/2 convolutional code with constraint length 7.作者: 飛鏢 時間: 2025-3-26 09:03 作者: Wernickes-area 時間: 2025-3-26 16:42
Some decoding applications of minimal realization,, thus avoiding the “key equation” and Forney‘s procedure. We also discuss simplification of the theory in characteristic two and an extension of the . theory to several sequences, obtaining a new . algorithm.作者: 輕而薄 時間: 2025-3-26 16:57 作者: Frenetic 時間: 2025-3-26 20:58
Soft decision decoding of Reed Solomon codes using the Dorsch algorithm,e formulated as binary codes in order to compare the two approaches. On the AWGN channel, the binary approach shows better performance for the same complexity than the multilevel approach and it appears that the Dorsch algorithm is not well suited to multilevel codes.作者: 歡樂東方 時間: 2025-3-27 04:44 作者: 跳脫衣舞的人 時間: 2025-3-27 07:13 作者: GILD 時間: 2025-3-27 11:48
Peng Zhaot the size of this coalition does not exceed some value)..By means of block designs a tradeoff can be made between the size of the largest admissible coalition and the total length of the keys that each user has to store. The proposed system is unconditionally secure and seems better suited for large coalitions than existing schemes.作者: Delectable 時間: 2025-3-27 14:54 作者: hematuria 時間: 2025-3-27 19:15
Conference proceedings 1995munication, processing, and storage. Among the topics addressed are linear codes, error-correcting codes, decoding, key distribution, authentication, hash functions, block ciphers, cryptanalysis, and electronic cash.作者: forebear 時間: 2025-3-28 01:48 作者: Keratectomy 時間: 2025-3-28 02:35 作者: leniency 時間: 2025-3-28 08:36 作者: abreast 時間: 2025-3-28 14:17
Authentication codes: An area where coding and cryptology meet,here is to append to a message a (relatively short) tail that depends in an essential way on every bit in the message and also on a key that is shared with the legitimate receiver..Some well-known bounds on the probability of successful substitution and impersonation will be given. Further, a direct作者: Generosity 時間: 2025-3-28 16:55
Peng Zhaoredicted wide-scale commercial deployment of cryptographic technology is finally occurring. As designers seek to provide implementations of public-key cryptography which offer adequate security while minimizing the computational requirements thereof, various options are available regarding parameter作者: Decibel 時間: 2025-3-28 19:07
Peng Zhao the system with a set of keys. If at a later stage, some users are no longer entitled to the messages, they should also no longer be able to decrypt them. This should even be the case if these illegitimate users can form a coalition and exchange the keys that they have obtained before (provided tha作者: 火車車輪 時間: 2025-3-29 00:32 作者: 能得到 時間: 2025-3-29 03:10
Peng Zhao, the algorithm here presented is based on the realization of bit wise logic operations. The numerical results obtained are valid for any nonlinear function with a unique term of maximum order and for any maximal-length LFSR. To illustrate the power of this technique, we give some high lower bounds 作者: MURKY 時間: 2025-3-29 11:02
Peng Zhaoesentation of the design and proof of the algorithm. The performance of this new method is analysed and compared with previously proposed methods. The techniques presented in this paper have applications in speeding up the implementation of public-key cryptographic algorithms such as RSA [3].作者: KEGEL 時間: 2025-3-29 12:08 作者: institute 時間: 2025-3-29 16:06
Peng Zhaoon radars and CDMA systems. This paper will first discuss the necessary and sufficient condition for, and some useful properties of, perfect sequences. Then, a comprehensive description of various perfect sequences is given. The emphasis will be on the synthesis of different perfect sequences, inclu作者: 鎮(zhèn)痛劑 時間: 2025-3-29 21:33
Peng Zhaodropper cannot economically store all the data sent over a certain time period. The two legitimate parties select bits randomly from this channel, and use as key bits those which they have selected in common. The work is inspired by recent work of Maurer, [3].作者: 消耗 時間: 2025-3-30 02:52 作者: 呼吸 時間: 2025-3-30 06:24
https://doi.org/10.1007/978-981-99-1354-1terms of very sparse invertible matrices, in such a way that the decoder can treat the signal and the noise symmetrically. The decoding problem involves only very sparse matrices and sparse vectors, and so is a promising candidate for practical decoding..It can be proved that these codes are ‘very g作者: 圍巾 時間: 2025-3-30 11:54
Xianlin Liu,Jianming Wang,Yukuan Suny on our communications networks. This technique, known as quantum cryptography, is the result of a synthesis of ideas from fundamental quantum physics and classical encryption. We review the developments in this rapidly-growing field.作者: Kinetic 時間: 2025-3-30 14:52 作者: 傷心 時間: 2025-3-30 17:14 作者: 有助于 時間: 2025-3-30 22:02
https://doi.org/10.1007/978-981-99-1354-1f to a message that the message is authentic, i.e. it was not sent by an imposter and it has not been altered on its way to the receiver. The imposter may replace an authenticated message by another message (substitution) or may just try to send his own message (impersonation). The aspect of secrecy作者: BORE 時間: 2025-3-31 03:01 作者: Flounder 時間: 2025-3-31 05:06
Xianlin Liu,Jianming Wang,Yukuan SunA multi-dimensional non-binary ring trellis coded modulation (R-TCM) scheme suitable for fading channels which is superior to conventional binary TCM is considered.作者: 果仁 時間: 2025-3-31 12:02 作者: 離開就切除 時間: 2025-3-31 13:20 作者: CONE 時間: 2025-3-31 20:54
Minimal weight ,-SR representations,esentation of the design and proof of the algorithm. The performance of this new method is analysed and compared with previously proposed methods. The techniques presented in this paper have applications in speeding up the implementation of public-key cryptographic algorithms such as RSA [3].作者: Negligible 時間: 2025-3-31 22:48
A storage complexity based analogue of Maurer key establishment using public channels,dropper cannot economically store all the data sent over a certain time period. The two legitimate parties select bits randomly from this channel, and use as key bits those which they have selected in common. The work is inspired by recent work of Maurer, [3].作者: 充滿裝飾 時間: 2025-4-1 03:07
Quantum cryptography: Protecting our future networks with quantum mechanics,y on our communications networks. This technique, known as quantum cryptography, is the result of a synthesis of ideas from fundamental quantum physics and classical encryption. We review the developments in this rapidly-growing field.作者: pessimism 時間: 2025-4-1 08:32
Cryptography and Coding978-3-540-49280-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 食料 時間: 2025-4-1 12:47
Peng Zhaoesentation of the design and proof of the algorithm. The performance of this new method is analysed and compared with previously proposed methods. The techniques presented in this paper have applications in speeding up the implementation of public-key cryptographic algorithms such as RSA [3].作者: d-limonene 時間: 2025-4-1 16:09
Peng Zhaodropper cannot economically store all the data sent over a certain time period. The two legitimate parties select bits randomly from this channel, and use as key bits those which they have selected in common. The work is inspired by recent work of Maurer, [3].
