Browse All Reviews
Data Encryption (E.3)
> Code Breaking (E.3...)
All Media Types
1-10 of 26 Reviews about "
Code Breaking (E.3...)
The Turing guide
Copeland J., Bowen J., Sprevak M., Wilson R., Oxford University Press, New York, NY, 2017.Type: Book (9780198747826 ), Reviews: (2 of 2)
The 42 chapters of this richly illustrated book describe Turing’s life and contributions from different viewpoints and at different abstraction levels. These essays, written for a (more or less) general audience, frequently show that Turing&...
Jul 7 2017
The Turing guide
Copeland J., Bowen J., Sprevak M., Wilson R., Oxford University Press, New York, NY, 2017.Type: Book (9780198747826 ), Reviews: (1 of 2)
According to a famous dictum, history is written by the victors....
Jun 14 2017
On the rank of incidence matrices for points and lines of finite affine and projective geometries over a field of four elements
Kovalenko M., Urbanovich T. Problems of Information Transmission 50(1): 79-89, 2014. Type: Article
An incidence geometry is, briefly described, a set of elements that have a different type and an incidence relation satisfying certain axioms. Typical examples include projective spaces, affine spaces, and polar spaces. The elements of type 1 are ...
Feb 2 2015
Titans’ revenge: detecting Zeus via its own flaws
Riccardi M., Di Pietro R., Palanques M., Vila J. Computer Networks 57(2): 422-435, 2013. Type: Article
Malware has become an underground industry, rapidly evolving in response to attempts by computer security experts and organizations to keep it in check. One of the most notorious examples of this pattern is Zeus malware, and specifically the Zeus ...
Jul 30 2013
Self-orthogonal 3-(56,12,65) designs and extremal doubly-even self-dual codes of length 56
Harada M. Designs, Codes and Cryptography 38(1): 5-16, 2006. Type: Article
If you want to know that the code generated by the rows of a block-point incidence matrix of a self-orthogonal 3-(56,12,65) design is a doubly-even self-dual code of length 56, that the code words of minimum weight generate an extremal doubly-even...
Jan 15 2008
Quantum cryptography: a survey
Bruss D., Erdélyi G., Meyer T., Riege T., Rothe J. ACM Computing Surveys 39(2): 6-es, 2007. Type: Article
Despite its title, this survey develops only two applications of cryptographic protocols in quantum computing: key distribution and bit commitment protocol, both of which relate to the BB84 protocol proposed in 1984 by Bennett and Brassard .
Aug 10 2007
On the security of stepwise triangular systems
Wolf C., Braeken A., Preneel B. Designs, Codes and Cryptography 40(3): 285-302, 2006. Type: Article
be a finite field of
be a system of quadratic polynomials
, ... ,
Apr 11 2007
Introduction to coding theory
Roth R., Cambridge University Press, New York, NY, 2006. 578 pp. Type: Book (9780521845045)
“Error correcting codes constitute one of the key ingredients in achieving the high degree of reliability required in modern data transmission and storage systems.” With this sentence, Ron Roth sets the stage for his textbook on coding...
Jan 5 2007
Construction of perfect
-ary codes by switchings of simple components
Los’ A. Problems of Information Transmission 42(1): 30-37, 2006. Type: Article
One task of coding theory is to determine the number of nonequivalent codes (or even give explicit constructions) with prescribed parameters, such as minimum weight, length, and dimension (for linear codes). In this paper, the author presents a co...
Nov 7 2006
Index calculation attacks on RSA signature and encryption
Coron J., Naccache D., Desmedt Y., Odlyzko A., Stern J. Designs, Codes and Cryptography 38(1): 41-53, 2006. Type: Article
This paper reports on a chosen ciphertext attack on the use of the RSA algorithm for digital signatures. It also describes a related attack on RSA-based privacy, but the main interest is in signatures. This attack is applied to a working encryptio...
Jul 3 2006
Reproduction in whole or in part without permission is prohibited. Copyright © 2000-2021 ThinkLoud, Inc.