Free quantum cryptography software for linux

Quantum GIS (QGIS) is a cross-platform Geographic Information System (GIS). Quantum GIS project offers support for vector and raster formats, including spatially enabled tables in PostgreSQL using PostGIS, common GIS vector formats such as Shapefiles, and geo-referenced rasters (TIFF, PNG, and GEOTIFF).
Many plugins are available to dynamically add new functionality. Viewing of GRASS layers (vector and raster) is provided by a plugin. GRASS vector layers can be edited in QGIS.
Main features:
- Support for spatially enabled PostGIS tables
- Support for shapefiles, ArcInfo coverages, Mapinfo, and other formats supported by OGR
- Raster support for a large number of formats
- Identify features
- Display attribute tables
- Select features
- GRASS Digitizing
- Feature labeling
Enhancements:
- Numerous bugfixes and stability improvements.

C++ Elliptic Curve Cryptography library is a C++ library for elliptic curves cryptography.
Libecc is a C++ elliptic curve cryptography library that supports fixed-size keys for maximum speed.
The goal of this project is to become the first free Open Source library providing the means to generate safe elliptic curves, and to provide an important source of information for anyone with general interest in ECC.
Enhancements:
- This version brings the code completely up to date again with the latest of version of the working set (autoconf, compiler, etc.).
- The previous version was almost two years old and didnt even compile anymore.

libquantum is a C library for the simulation of a quantum computer. libquantum provides an interface for a quantum register and for all important quantum operations.
An efficient model for decoherence allows an analysis of quantum computation in a realistic environment.
Main features:
- Simulation of arbitrary quantum algorithms is possible
- High perfomance and low memory consumption
- Decoherence support for realistic quantum computation
- Interface for quantum error correction (QEC)
- Supports the density operator formalism
- Implementations of Shors factoring algorithm and Grovers search algorithm are included
- libquantum is available as Free Software under the terms of the GNU General Public License (GPL). See the file COPYING for further details.

Quantum Minigolf is nearly the same as the game minigolf - except that the ball obeys the laws of quantum mechanics.

Such a ball can be at several places at once. It can diffract around obstacles and interfere with itself. Apart from that, the rules are the same: You can play on various tracks involving various obstacles. You hit the ball with a club and try to kick it into a hole on the other side of the track.


The software

To play quantum minigolf, download the game in the download section. It is a GPLed C++ program, which has been tested under Windows and Linux. It features a simple user interface. You can add your own tracks by editing them in any image editing software and saving them in bmp format.

The hardware

There also exists a (virtually) real version of quantum minigolf. It permits to play with a real club and a ball which is projected onto the track by a video projector mounted on a 2m (6ft) high tripod. The club is marked by an infrared LED, and detected by a webcam next to the video projector. An image recognition algorithm in the quantum minigolf software computes the club position and feeds back hits into the simulation.

Quantum::Superpositions package contains QM-like superpositions in Perl.

SYNOPSIS

use Quantum::Superpositions;

if ($x == any($a, $b, $c)) { ... }

while ($nextval < all(@thresholds)) { ... }

$max = any(@value) < all(@values);


use Quantum::Superpositions BINARY => [ CORE::index ];

print index( any("opts","tops","spot"), "o" );
print index( "stop", any("p","s") );

BACKGROUND

Under the standard interpretation of quantum mechanics, until they are observed, particles exist only as a discontinuous probability function. Under the Cophenhagen Interpretation, this situation is often visualized by imagining the state of an unobserved particle to be a ghostly overlay of all its possible observable states simultaneously. For example, a particle that might be observed in state A, B, or C may be considered to be in a pseudo-state where it is simultaneously in states A, B, and C. Such a particle is said to be in a superposition of states.

Research into applying particle superposition in construction of computer hardware is already well advanced. The aim of such research is to develop reliable quantum memories, in which an individual bit is stored as some measurable property of a quantised particle (a qubit). Because the particle can be physically coerced into a superposition of states, it can store bits that are simultaneously 1 and 0.

Specific processes based on the interactions of one or more qubits (such as interference, entanglement, or additional superposition) are then be used to construct quantum logic gates. Such gates can in turn be employed to perform logical operations on qubits, allowing logical and mathematical operations to be executed in parallel.

Unfortunately, the math required to design and use quantum algorithms on quantum computers is painfully hard. The Quantum::Superpositions module offers another approach, based on the superposition of entire scalar values (rather than individual qubits).

Quantum::Entanglement package contains QM entanglement of variables in perl.

SYNOPSIS

use Quantum::Entanglement qw(:DEFAULT :complex :QFT);

my $c = entangle(1,0,i,1); # $c = |0> + i|1>
my $d = entangle(1,0,1,1); # $d = |0> + |1>

$e = $c * $d; # $e now |0*0> + i|0*1> + |1*0> + i|1*1>, connected to $c, $d

if ($e == 1) { # observe, probabilistically chose an outcome
# if we are here, ($c,$d) = i|(1,1)>
print "* $e == 1n";
}
else { # one of the not 1 versions of $e chosen
# if we are here, ($c,$d) = |(0,0)> + i|(1,0)> + |(0,1)>
print "* $e != 1n";
}

BACKGROUND

"Quantum Mechanics - the dreams that stuff is made of."

Quantum mechanics is one of the stranger things to have emerged from science over the last hundred years. It has led the way to new understanding of a diverse range of fundamental physical phenomena and, should recent developments prove fruitful, could also lead to an entirely new mode of computation where previously intractable problems find themselves open to easy solution.

While the detailed results of quantum theory are hard to prove, and even harder to understand, there are a handful of concepts from the theory which are more easily understood. Hopefully this module will shed some light on a few of these and their consequences.

One of the more popular interpretations of quantum mechanics holds that instead of particles always being in a single, well defined, state they instead exist as an almost ghostly overlay of many different states (or values) at the same time. Of course, it is our experience that when we look at something, we only ever find it in one single state. This is explained by the many states of the particle collapsing to a single state and highlights the importance of observation.

In quantum mechanics, the state of a system can be described by a set of numbers which have a probability amplitude associated with them. This probability amplitude is similar to the normal idea of probability except for two differences. It can be a complex number, which leads to interference between states, and the probability with which we might observe a system in a particular state is given by the modulus squared of this amplitude.

Consider the simple system, often called a qubit, which can take the value of 0 or 1. If we prepare it in the following superposition of states (a fancy way of saying that we want it to have many possible values at once):

particle = 1 * (being equal to 1) + (1-i) * (being equal to 0)

we can then measure (observe) the value of the particle. If we do this, we find that it will be equal to 1 with a probability of

1**2 / (1**2 + (1-i)(1+i) )

and equal to zero with a probability of

(1+i)(1-i) / (1**2 + (1-i)(1+i) )

the factors on the bottom of each equation being necessary so that the chance of the particle ending up in any state at all is equal to one.

Observing a particle in this way is said to collapse the wave-function, or superposition of values, into a single value, which it will retain from then onwards. A simpler way of writing the equation above is to say that

particle = 1 |1> + (1-i) |0>

where the probability amplitude for a state is given as a multiplier of the value of the state, which appears inside the | > pattern (this is called a ket, as sometimes the bra or < |, pattern appears to the left of the probability amplitudes in these equations).

Much of the power of quantum computation comes from collapsing states and modifying the probability with which a state might collapse to a particular value as this can be done to each possible state at the same time, allowing for fantastic degrees of parallelism.

Things also get interesting when you have multiple particles together in the same system. It turns out that if two particles which exist in many states at once interact, then after doing so, they will be linked to one another so that when you measure the value of one you also affect the possible values that the other can take. This is called entanglement and is important in many quantum algorithms.

LibTomCrypt is a comprehensive, modular, and portable cryptographic toolkit that provides developers with a vast array of well known published block ciphers, one-way hash functions, chaining modes, pseudo- random number generators, public key cryptography, and a plethora of other routines. It has been designed from the ground up to be very simple to use. It has a modular and standard API that allows new ciphers, hashes, and PRNGs to be added or removed without change to the overall end application. It features functions for easy handling and a complete user manual which has many source snippet examples.
LibTomCrypt is a fairly comprehensive, modular and portable cryptographic toolkit that provides developers with a vast array of well known published block ciphers, one-way hash functions, chaining modes, pseudo-random number generators, public key cryptography and a plethora of other routines.
LibTomCrypt has been designed from the ground up to be very simple to use. It has a modular and standard API that allows new ciphers, hashes and PRNGs to be added or removed without change to the overall end application. It features easy to use functions and a complete user manual which has many source snippet examples.
LibTomCrypt is free for all purposes under the public domain. This includes commercial use, redistribution and even branching.
Main features:
- Public domain and open source.
- Written entirely in portable ISO C source (except for things like RNGs for natural reasons)
- Builds out of the box on virtually every box. All that is required is GCC for the source to build.
- Includes a 90+ page user manual in PDF format (with working examples in it)
- Block Ciphers
- Ciphers come with an ECB encrypt/decrypt, setkey and self-test interfaces.
- All ciphers have the same prototype which facilitates using multiple ciphers at runtime.
- Some of the ciphers are flexible in terms of code size and memory usage.
- Ciphers Supported.
- Blowfish
- XTEA
- RC5
- RC6
- SAFER+
- Rijndael (aka AES)
- Twofish
- SAFER (K64, SK64, K128, SK128)
- RC2
- DES, 3DES
- CAST5
- Noekeon
- Skipjack
- Anubis (with optional tweak as proposed by the developers)
- Khazad
- Changing Modes
- Modes come with a start, encrypt/decrypt and set/get IV interfaces.
- Mode supported.
- ECB
- CBC
- OFB
- CFB
- CTR
- One-Way Hash Functions
- Hashes come with init, process, done and self-test interfaces.
- All hashes use the same prototypes for the interfaces.
- Hashes supported.
- MD2
- MD4
- MD5
- SHA-1
- SHA-224/256/384/512
- TIGER-192
- RIPE-MD 128/160
- WHIRLPOOL
- Message Authentication
- FIPS-198 HMAC (supports all hashes)
- FIPS pending OMAC1 (supports all ciphers)
- PMAC Authentication
- Message Encrypt+Authenticate Modes
- EAX Mode
- OCB Mode
- Pseudo-Random Number Generators
- Yarrow (based algorithm)
- RC4
- Support for /dev/random, /dev/urandom and the Win32 CSP RNG
- Fortuna
- SOBER-128
- Public Key Algorithms
- RSA (using PKCS #1 v2.1 and PKCS #1 v1.5)
- DH (using ElGamal signatures and simple DH encryption)
- ECC (over Z/pZ, ElGamal Signatures, simple DH style encryption)
- DSA (Users make their own groups)
- Other standards
- PKCS #1 (both v1.5 and v2.0 padding)
- PKCS #5
- ASN.1 DER for INTEGER types.
Enhancements:
- The ECC code was fixed, cleaned, and improved.
- GCM was fixed.
- UTF8 support was added to the ASN1 code.
- The documentation was improved.
- The published version of the manual is included.

trfcrypt is an add-on package to the tcl-extension trf. It provides the encryption functionality which was removed from the base package to allow its inclusion on the Tcl/Tk CDROM without violating US export control laws on cryptography.
The C API is layered on top of the trf C API and provides a set of commands for the management, implementation and usage of blockciphers and stream.
Although it is possible to implement ciphers using only the trf C API the code in this package makes it much easier, as general things like the handling of blockcipher modes are done here, thus obviating the need to reimplement them every time. A new cipher just has to provide some information about itself (key sizes) and functions to:
- generate the internal keyschedule from the specified key
- encrypt/decrypt a character or a block of data