No abstract available.
Cited By
- Tarau P and Luderman B Symbolic modeling of a universal reconfigurable logic gate and its applications to circuit synthesis Proceedings of the 2012 ACM Research in Applied Computation Symposium, (389-394)
- Lundin R and Lindskog S Entropy of selectively encrypted strings Proceedings of the 5th IFIP WG 11.2 international conference on Information security theory and practice: security and privacy of mobile devices in wireless communication, (234-243)
- Lundin R and Lindskog S Security implications of selective encryption Proceedings of the 6th International Workshop on Security Measurements and Metrics, (1-8)
- Nakahara J, Sepehrdad P, Zhang B and Wang M Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT Proceedings of the 8th International Conference on Cryptology and Network Security, (58-75)
- Florio V and Blondia C (2008). A survey of linguistic structures for application-level fault tolerance, ACM Computing Surveys, 40:2, (1-37), Online publication date: 1-Apr-2008.
- Tarau P and Luderman B Exact combinational logic synthesis and non-standard circuit design Proceedings of the 5th conference on Computing frontiers, (179-188)
- Law E, Klobučar T and Pipan M Analysis of user attitude and behaviour in evaluating a personalized search engine Proceedings of the 13th Eurpoean conference on Cognitive ergonomics: trust and control in complex socio-technical systems, (1-9)
- Baignères T and Finiasz M Dial C for cipher Proceedings of the 13th international conference on Selected areas in cryptography, (76-95)
- Law E, Klobučar T and Pipan M User effect in evaluating personalized information retrieval systems Proceedings of the First European conference on Technology Enhanced Learning: innovative Approaches for Learning and Knowledge Sharing, (257-271)
- Picard R, Papert S, Bender W, Blumberg B, Breazeal C, Cavallo D, Machover T, Resnick M, Roy D and Strohecker C (2004). Affective Learning — A Manifesto, BT Technology Journal, 22:4, (253-269), Online publication date: 1-Oct-2004.
- Eisenberg M Creating a computer science canon Proceedings of the 34th SIGCSE technical symposium on Computer science education, (336-340)
- Eisenberg M (2003). Creating a computer science canon, ACM SIGCSE Bulletin, 35:1, (336-340), Online publication date: 11-Jan-2003.
- Pierce J Information theory Encyclopedia of Computer Science, (869-870)
- Pierce J Shannon, Claude E. Encyclopedia of Computer Science, (1570-1571)
- March L Foreword Formal engineering design synthesis, (.11-.13)
- Liefke H and Suciu D (2000). XMill, ACM SIGMOD Record, 29:2, (153-164), Online publication date: 1-Jun-2000.
- Liefke H and Suciu D XMill Proceedings of the 2000 ACM SIGMOD international conference on Management of data, (153-164)
- Shepard T A channel access scheme for large dense packet radio networks Conference proceedings on Applications, technologies, architectures, and protocols for computer communications, (219-230)
- Shepard T (1996). A channel access scheme for large dense packet radio networks, ACM SIGCOMM Computer Communication Review, 26:4, (219-230), Online publication date: 1-Oct-1996.
Index Terms
- Claude Elwood Shannon: collected papers
Recommendations
Properties of two Shannon's ciphers
In 1949 Shannon published the famous paper "Communication theory of secrecy systems" where he briefly described two ciphers, but did not investigate their properties. In this note we carry out information-theoretical analysis of these ciphers. In ...
Comparison of Shannon, Renyi and Tsallis Entropy Used in Decision Trees
ICAISC '08: Proceedings of the 9th international conference on Artificial Intelligence and Soft ComputingShannon entropy used in standard top-down decision trees does not guarantee the best generalization. Split criteria based on generalized entropies offer different compromise between purity of nodes and overall information gain. Modified C4.5 decision ...
Garbling Gadgets for Boolean and Arithmetic Circuits
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications SecurityWe present simple, practical, and powerful new techniques for garbled circuits. These techniques result in significant concrete and asymptotic improvements over the state of the art, for several natural kinds of computations. For arithmetic circuits ...