標(biāo)題: Titlebook: Coding Theory and Cryptography; From Enigma and Gehe David Joyner Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 Coding [打印本頁] 作者: 手套 時(shí)間: 2025-3-21 16:58
書目名稱Coding Theory and Cryptography影響因子(影響力)
書目名稱Coding Theory and Cryptography影響因子(影響力)學(xué)科排名
書目名稱Coding Theory and Cryptography網(wǎng)絡(luò)公開度
書目名稱Coding Theory and Cryptography網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Coding Theory and Cryptography被引頻次
書目名稱Coding Theory and Cryptography被引頻次學(xué)科排名
書目名稱Coding Theory and Cryptography年度引用
書目名稱Coding Theory and Cryptography年度引用學(xué)科排名
書目名稱Coding Theory and Cryptography讀者反饋
書目名稱Coding Theory and Cryptography讀者反饋學(xué)科排名
作者: cumulative 時(shí)間: 2025-3-21 22:51
Ombretta Repetto,Karine Gallardoometry and finite geometry. Further, we exhibit a complete .-arc over the field .., for even .. In the last section we discuss a connection between modular representations of the general linear group over .. and the question of whether a given cyclic code is MDS.作者: 適宜 時(shí)間: 2025-3-22 00:47
“I Do Not Need Help to Define Myself”all going under the BP code name of Sturgeon, while the Siemens T43 probably was the unbreakable machine that BP called Thrasher. The T43 machine came into use relatively late in the war and appears to have been used only on a few selected circuits.作者: ENACT 時(shí)間: 2025-3-22 07:04 作者: achlorhydria 時(shí)間: 2025-3-22 09:43 作者: SHRIK 時(shí)間: 2025-3-22 16:03
ings of the Conference on Coding Theory, Cryptography, and Number Theory held at the U. S. Naval Academy during October 25-26, 1998. This book concerns elementary and advanced aspects of coding theory and cryptography. The coding theory contributions deal mostly with algebraic coding theory. Some of作者: SHRIK 時(shí)間: 2025-3-22 19:50 作者: 讓步 時(shí)間: 2025-3-22 23:57 作者: 表被動(dòng) 時(shí)間: 2025-3-23 02:24 作者: 縮影 時(shí)間: 2025-3-23 06:13
Sangeeta Dhaubhadel,Frédéric Marsolaisffine line. In the second half we will design algorithms for computing roots of polynomials over the function field of a nonsingular absolutely irreducible plane algebraic curve. Several examples are included.作者: EWE 時(shí)間: 2025-3-23 12:39 作者: 善辯 時(shí)間: 2025-3-23 14:35
Number Theory and Cryptography (using Maple),al teaching details, but will happily forward all teaching materials (notes, examination papers, etc.) to any interested readers. Finally, several of my NT and Cryptography course Maple worksheets. are available on the internet [Cos].作者: 貨物 時(shí)間: 2025-3-23 19:37
The Rigidity Theorems of Hamada and Ohmori, Revisited,idity theorem of Hamada and Ohmori, who assumed that . + 1 is a power of 2 and that . is already known to be the incidence matrix of a Hadamard design. Our results follow from a generalization of a rank inequality of Wallis.作者: Inkling 時(shí)間: 2025-3-23 22:39 作者: Genome 時(shí)間: 2025-3-24 06:21
On Cyclic MDS-Codes,ometry and finite geometry. Further, we exhibit a complete .-arc over the field .., for even .. In the last section we discuss a connection between modular representations of the general linear group over .. and the question of whether a given cyclic code is MDS.作者: 琺瑯 時(shí)間: 2025-3-24 08:28
Reminiscences and Reflections of a Codebreaker, Enigma, by Andrew Hodges [Ho], a sensitive and enormously informative biography of a genius who made a unique contribution to winning the war while he was simultaneously inventing the computer; and Codebreakers, edited by F. H. Hinsley and Alan Stripp [Hin], a series of articles providing detailed 作者: paragon 時(shí)間: 2025-3-24 11:28 作者: Malfunction 時(shí)間: 2025-3-24 15:32
Sturgeon, The FISH BP Never Really Caught,lso called Tunny by Bletchley Park (BP), the Siemens . (SFM) T52, and the one-time-tape machine T43, also manufactured by Siemens. The Lorenz machines, which existed in three different models, SZ40, SZ42a, and SZ42b, are well known as the machines that were broken at BP with the aid of Colossus. The作者: Silent-Ischemia 時(shí)間: 2025-3-24 21:01 作者: 群島 時(shí)間: 2025-3-25 00:28 作者: 細(xì)頸瓶 時(shí)間: 2025-3-25 05:28
The RSA Public Key Cryptosystem, it was introduced in 1978. Numerous descriptions of the algorithm have been published. Readers with a knowledge of a little basic number theory will find the original paper [RSA] by the inventors of the algorithm, Ronald L. Rivest, Adi Shamir, and Leonard M. Adleman, quite readable. Perhaps the mos作者: 誘惑 時(shí)間: 2025-3-25 11:23 作者: 發(fā)怨言 時(shí)間: 2025-3-25 12:55
A Talk on Quantum Cryptography or How Alice Outwits Eve,in cryptography, the other in quantum mechanics. During the courses, she discovers she can use what she has just learned to devise a cryptographic communication system that automatically detects whether or not Eve is up to her villainous eavesdropping. Some of the topics discussed are Heisenberg’s U作者: 小樣他閑聊 時(shí)間: 2025-3-25 18:41
The Rigidity Theorems of Hamada and Ohmori, Revisited,eld of characteristic 2 satisfies.with equality if and only if . is the incidence matrix of a point-hyperplane Hadamard design. This generalizes a rigidity theorem of Hamada and Ohmori, who assumed that . + 1 is a power of 2 and that . is already known to be the incidence matrix of a Hadamard design作者: 中和 時(shí)間: 2025-3-25 21:08 作者: 嘮叨 時(shí)間: 2025-3-26 00:52
Computing Roots of Polynomials over Function Fields of Curves, algebraic-geometric codes. In the first half of the paper we will focus on bivariate polynomials, i.e., polynomials over the coordinate ring of the affine line. In the second half we will design algorithms for computing roots of polynomials over the function field of a nonsingular absolutely irredu作者: 容易做 時(shí)間: 2025-3-26 06:43 作者: Hemoptysis 時(shí)間: 2025-3-26 08:47 作者: cultivated 時(shí)間: 2025-3-26 14:00
William C. Plaxton,Brendan O’Leary eavesdropping on Alice’s communications with Bob. How does Alice do this? Also, how does she implement her ideas in optics?.This talk is based on the paper: Lomonaco, Samuel J., A Quick Glance at Quan-tum Cryptography, Cryptologia, Vol. 23, No.1, January, 1999, pp1–41. (Quant-ph/9811056)作者: follicular-unit 時(shí)間: 2025-3-26 19:42
ch on quantum cryptography (Lomonoco) are described. There are two papers concerned with the RSA cryptosystem and related number-theoretic issues (Wardlaw, Cosgrave).978-3-540-66336-2978-3-642-59663-6作者: 集聚成團(tuán) 時(shí)間: 2025-3-26 22:14
Reminiscences and Reflections of a Codebreaker, read messages encrypted by these machines. It is a great advantage, of course, for those able, like Jack Good, to provide precise descriptions of these machines and of our methods, that much of the necessary information has now, at long last, been declassified.作者: bacteria 時(shí)間: 2025-3-27 03:04
The RSA Public Key Cryptosystem,eded to understand the RSA algorithm. The prerequisites are only a knowledge of the elementary school arithmetic of the integers, high school algebra, some familiarity with the notions of sets and of functions, and, most importantly, a real desire to understand how the RSA algorithm works. We begin 作者: 情感 時(shí)間: 2025-3-27 08:53
A Talk on Quantum Cryptography or How Alice Outwits Eve, eavesdropping on Alice’s communications with Bob. How does Alice do this? Also, how does she implement her ideas in optics?.This talk is based on the paper: Lomonaco, Samuel J., A Quick Glance at Quan-tum Cryptography, Cryptologia, Vol. 23, No.1, January, 1999, pp1–41. (Quant-ph/9811056)作者: APNEA 時(shí)間: 2025-3-27 12:07 作者: 牌帶來 時(shí)間: 2025-3-27 15:39
Ecological implications of myrmecochory,This paper is an exposition of some aspects of geometric coding theory and Goppa codes on modular curves.作者: 出生 時(shí)間: 2025-3-27 18:28 作者: FRET 時(shí)間: 2025-3-27 21:59
Remarks on codes from modular curves: MAPLE applications,This paper is an exposition of some aspects of geometric coding theory and Goppa codes on modular curves.作者: 本土 時(shí)間: 2025-3-28 05:14 作者: 托運(yùn) 時(shí)間: 2025-3-28 09:36 作者: decipher 時(shí)間: 2025-3-28 13:12 作者: 云狀 時(shí)間: 2025-3-28 18:33
Sidney Dang,Derek Vigon,Jaleel Abdul-Adilerman machine-cipher known in Bletchley as “FISH”. The network using this system grew to have many links and each link was given the name of a kind of fish. Thus the first link to be intercepted was called “Tunny” and I recall such names as “Bream”, “Herring” and “Mackerel” for later links.作者: 注視 時(shí)間: 2025-3-28 18:58
“I Do Not Need Help to Define Myself”lso called Tunny by Bletchley Park (BP), the Siemens . (SFM) T52, and the one-time-tape machine T43, also manufactured by Siemens. The Lorenz machines, which existed in three different models, SZ40, SZ42a, and SZ42b, are well known as the machines that were broken at BP with the aid of Colossus. The作者: Obstacle 時(shí)間: 2025-3-29 01:33 作者: 使人入神 時(shí)間: 2025-3-29 04:55 作者: 冰河期 時(shí)間: 2025-3-29 09:23 作者: 陪審團(tuán) 時(shí)間: 2025-3-29 12:33
Determination of the Surface Areas of Seed,e basic number theoretical topics related to cryptography, based on my experience as a teacher of those topics. I am omitting all reference to practical teaching details, but will happily forward all teaching materials (notes, examination papers, etc.) to any interested readers. Finally, several of 作者: 魅力 時(shí)間: 2025-3-29 17:05 作者: Mobile 時(shí)間: 2025-3-29 19:43
Ombretta Repetto,Karine Gallardoeld of characteristic 2 satisfies.with equality if and only if . is the incidence matrix of a point-hyperplane Hadamard design. This generalizes a rigidity theorem of Hamada and Ohmori, who assumed that . + 1 is a power of 2 and that . is already known to be the incidence matrix of a Hadamard design作者: Slit-Lamp 時(shí)間: 2025-3-30 03:58
Ombretta Repetto,Karine Gallardotion properties of the polynomial (..-1)/(.-1) for a certain .. Using results on these polynomials we prove that over fields of odd characteristic the only MDS cyclic codes of dimension 3 are the Reed-Solomon codes. For codes of dimension . we prove the same result using techniques from algebraic ge作者: Blanch 時(shí)間: 2025-3-30 04:15
Sangeeta Dhaubhadel,Frédéric Marsolais algebraic-geometric codes. In the first half of the paper we will focus on bivariate polynomials, i.e., polynomials over the coordinate ring of the affine line. In the second half we will design algorithms for computing roots of polynomials over the function field of a nonsingular absolutely irredu作者: notification 時(shí)間: 2025-3-30 09:56 作者: 羞辱 時(shí)間: 2025-3-30 14:10
978-3-540-66336-2Springer-Verlag Berlin Heidelberg 2000作者: Chauvinistic 時(shí)間: 2025-3-30 17:49
FISH and I,erman machine-cipher known in Bletchley as “FISH”. The network using this system grew to have many links and each link was given the name of a kind of fish. Thus the first link to be intercepted was called “Tunny” and I recall such names as “Bream”, “Herring” and “Mackerel” for later links.作者: 貴族 時(shí)間: 2025-3-30 22:07
The Geheimschreiber Secret,ole author of the original Swedish version of .., while Frode Weierud alone is responsible for the translation into English, the translator’s notes, and postscript, as well as the bibliography and the appendixes.作者: engender 時(shí)間: 2025-3-31 03:45 作者: STANT 時(shí)間: 2025-3-31 05:23
