|
CD-57
The (Hagelin) CD-57 was a portable, mechanical cipher machine manufactured by Crypto AG, first produced in 1957. It was derived from the earlier CD-55, and was designed to be compatible with the larger C-52 machines. Compact, the CD-57 measured merely 5 1/8in × 3 1/8in × 1 1/2in (13 × 8 × 3.8 cm) and weighed 1.5 pounds (680 gr). The CD-57 used six wheels. A variant is the CD-57(RT), a similar device using a one-time pad system rather than rotating wheels. The STG-61 was a licensed copy of the CD-57 by Hell. Sullivan (2002) shows how the CD-57 can be attacked using a search technique. See also * |
Crypto AG
Crypto AG was a Swiss company specialising in communications and information security founded by Boris Hagelin in 1952. The company was secretly purchased for US $5.75 million and jointly owned by the American Central Intelligence Agency (CIA) and West German Federal Intelligence Service (BND) from 1970 until about 1993, with the CIA continuing as sole owner until about 2018. The mission of breaking encrypted communication using a secretly owned company was known as " Operation Rubikon". With headquarters in Steinhausen, the company was a long-established manufacturer of encryption machines and a wide variety of cipher devices. The company had about 230 employees, had offices in Abidjan, Abu Dhabi, Buenos Aires, Kuala Lumpur, Muscat, Selsdon and Steinhausen, and did business throughout the world. The owners of Crypto AG were unknown, supposedly even to the managers of the firm, and they held their ownership through bearer shares. The company has been criticised for selling bac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
C-52 (cipher Machine)
The ( Hagelin) C-52 and CX-52 were cipher machines manufactured by Crypto AG starting 1951/1952. These pin-and-lug type cipher machines were advanced successors of the C-38/M-209. The machine measures . The device is mechanical, but when combined with an electric keyboard attachment, the B-52, the resultant system is termed the BC-52. The B-52 is larger, measuring . The Hell 54 was a licensed copy of the C-52 by German company Hell. Structure and operation Both C and CX models are equipped with six pinwheels. In the C-52 version, these six wheels are chosen from a possible set of 12, with the number of pins on each wheel being 25, 26, 29, 31, 34, 37, 38, 41, 42, 43, 46, and 47. The C model had a fixed stepping system with a large wheel cycle due to the mutually prime factors in the pin counts. The CX-52 version has 6 pinwheels with 47 pins each and a flexible wheel movement system. The lug cage of both models contains 32 movable bars: 27 of the bars are used for encryptio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
One-time Pad
In cryptography, the one-time pad (OTP) is an encryption technique that cannot be cracked, but requires the use of a single-use pre-shared key that is not smaller than the message being sent. In this technique, a plaintext is paired with a random secret key (also referred to as ''a one-time pad''). Then, each bit or character of the plaintext is encrypted by combining it with the corresponding bit or character from the pad using modular addition. The resulting ciphertext will be impossible to decrypt or break if the following four conditions are met: #The key must be at least as long as the plaintext. #The key must be random ( uniformly distributed in the set of all possible keys and independent of the plaintext), entirely sampled from a non-algorithmic, chaotic source such as a hardware random number generator. It is not sufficient for OTP keys to pass statistical randomness tests as such tests cannot measure entropy, and the number of bits of entropy must be at least equa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hill Climbing
numerical analysis, hill climbing is a mathematical optimization technique which belongs to the family of local search. It is an iterative algorithm that starts with an arbitrary solution to a problem, then attempts to find a better solution by making an incremental change to the solution. If the change produces a better solution, another incremental change is made to the new solution, and so on until no further improvements can be found. For example, hill climbing can be applied to the travelling salesman problem. It is easy to find an initial solution that visits all the cities but will likely be very poor compared to the optimal solution. The algorithm starts with such a solution and makes small improvements to it, such as switching the order in which two cities are visited. Eventually, a much shorter route is likely to be obtained. Hill climbing finds optimal solutions for convex problems – for other problems it will find only local optima (solutions that cannot be imp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
M-209
In cryptography, the M-209, designated CSP-1500 by the United States Navy (C-38 by the manufacturer) is a portable, mechanical cipher machine used by the US military primarily in World War II, though it remained in active use through the Korean War. The M-209 was designed by Swedish cryptographer Boris Hagelin in response to a request for such a portable cipher machine, and was an improvement of an earlier machine, the C-36. The M-209 is about the size of a lunchbox, in its final form measuring and weighing (plus for the case). It represented a brilliant achievement for pre-electronic technology. It was a rotor machine similar to a telecipher machine, such as the Lorenz cipher and the Geheimfernschreiber. Basic operation Basic operation of the M-209 is relatively straightforward. Six adjustable ''key wheels'' on top of the box each display a letter of the alphabet. These six wheels comprise the external key for the machine, providing an initial state, similar to an initial ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
