Key Recovery Systems As stated before the sense of cryptography is a properly designed cryptosystem making it essentially impossible to recover encrypted data without any knowledge of the used key. The issue of lost keys and the being-locked-out from one's own data as a consequence favors key recovery systems. On the other hand the counter argument is confidentiality: as soon as a possibility to recover a key is provided, the chances for abuses grow. Finally it is the state that does not want to provide too much secrecy. On the contrary. During the last 20 years endless discussions about the state's necessity and right to restrict private cryptography have taken place, as the governments rarely care for the benefit of private users if they believe in catching essential informations about any kind of enemy, hence looking for unrestricted access to all keys. The list of "key recovery," "key escrow," and "trusted third-party" as encryption requirements, suggested by governmental agencies, covers all the latest developments and inventions in digital technology. At the same time the NSA, one of the world's most advanced and most secret enterprises for cryptography, worked hard in getting laws through to forbid the private use of strong encryption in one way or the other. Still, it is also organizations like this one that have to admit that key recovery systems are not without any weaknesses, as the U.S. Escrowed Encryption Standard, the basis for the famous and controversially discussed Clipper Chip, showed. The reason for those weaknesses is the high complexity of those systems. Another aspect is that key recovery systems are more expensive and certainly much less secure than other systems. So, why should anyone use them? In that context, one has to understand the legal framework for the use of cryptography, a strict framework in fact, being in high contradiction to the globalised flow of communication. |
|
Disinformation and Science Disinformation's tools emerged from science and art. And furthermore: disinformation can happen in politics of course, but also in science: for example by launching ideas which have not been proven exactly until the moment of publication. e.g. the thought that time runs backwards in parts of the universe: |
|
Gait recognition The fact that an individual's identity is expressed not only by the way he/she looks or sounds, but also by the manner of walking is a relatively new discovery of in biometrics. Unlike the more fully developed biometric technologies whose scrutiny is directed at stationary parts of the body, gait recognition has the added difficulty of having to sample and identify movement. Scientists at the University of Southampton, UK ( Another model considers the shape and length of legs as well as the velocity of joint movements. The objective is to combine both models into one, which would make gait recognition a fully applicable biometric technology. Given that gait recognition is applied to "moving preambulatory subjects" it is a particularly interesting technology for surveillance. People can no longer hide their identity by covering themselves or moving. Female shop lifters who pretend pregnancy will be detected because they walk differently than those who are really pregnant. Potential wrongdoers might resort walking techniques as developed in Monty Pythons legendary "Ministry of Silly Walks" ( |
|
John von Neumann b. December 3, 1903, Budapest, Hungary d. February 8, 1957, Washington, D.C., U.S. Mathematician who made important contributions in quantum physics, logic, meteorology, and computer science. His theory of games had a significant influence upon economics. In computer theory, von Neumann did much of the pioneering work in logical design, in the problem of obtaining reliable answers from a machine with unreliable components, the function of "memory," machine imitation of "randomness," and the problem of constructing automata that can reproduce their own kind. |
|
Fiber-optic cable networks Fiber-optic cable networks may become the dominant method for high-speed Internet connections. Since the first fiber-optic cable was laid across the Atlantic in 1988, the demand for faster Internet connections is growing, fuelled by the growing network traffic, partly due to increasing implementation of corporate networks spanning the globe and to the use of graphics-heavy contents on the Fiber-optic cables have not much more in common with copper wires than the capacity to transmit information. As copper wires, they can be terrestrial and submarine connections, but they allow much higher transmission rates. Copper wires allow 32 telephone calls at the same time, but fiber-optic cable can carry 40,000 calls at the same time. A capacity, Copper wires will not come out of use in the foreseeable future because of technologies as For technical information from the Encyclopaedia Britannica on telecommunication cables, click An entertaining report of the laying of the FLAG submarine cable, up to now the longest fiber-optic cable on earth, including detailed background information on the cable industry and its history, Neal Stephenson has written for Wired: Mother Earth Mother Board. Click Susan Dumett has written a short history of undersea cables for Pretext magazine, Evolution of a Wired World. Click A timeline history of submarine cables and a detailed list of seemingly all submarine cables of the world, operational, planned and out of service, can be found on the Web site of the For maps of fiber-optic cable networks see the website of |
|
Alan Turing b. June 23, 1912, London, England d. June 7, 1954, Wilmslow, Cheshire English mathematician and logician who pioneered in the field of computer theory and who contributed important logical analyses of computer processes. Many mathematicians in the first decades of the 20th century had attempted to eliminate all possible error from mathematics by establishing a formal, or purely algorithmic, procedure for establishing truth. The mathematician Kurt Gödel threw up an obstacle to this effort with his incompleteness theorem. Turing was motivated by Gödel's work to seek an algorithmic method of determining whether any given propositions were undecidable, with the ultimate goal of eliminating them from mathematics. Instead, he proved in his seminal paper "On Computable Numbers, with an Application to the Entscheidungsproblem [Decision Problem]" (1936) that there cannot exist any such universal method of determination and, hence, that mathematics will always contain undecidable propositions. During World War II he served with the Government Code and Cypher School, at Bletchley, Buckinghamshire, where he played a significant role in breaking the codes of the German " |
|