- Full text PDF available (7)
Existing encryption schemes for VoIP audio/video telephone conversations are only secure under the assumption that the employed lightweight encryption algorithms are secure, that the telephony server is not manipulated and that no Man-in-the-Middle Attack is mounted on any endpoint. A new encryption method that entirely overcomes the shortcomings of… (More)
A " Post-Quantum Key Exchange " is needed since the availability of quantum computers that allegedly allow breaking classical algorithms like Diffie-Hellman, El Gamal, RSA and others within a practical amount of time is broadly assumed in literature. Although our survey suggests that practical quantum computers appear to be by far less advanced as actually… (More)
Permutable Chebyshev polynomials (T polynomials) defined over the field of real numbers are suitable for creating a Diffie-Hellman-like key exchange algorithm that is able to withstand attacks using quantum computers. The algorithm takes advantage of the commutative properties of Chebyshev polynomials of the first kind. We show how T polynomial values can… (More)
We present Scalable PMC Hash, a 1024-bit hash function operating on messages less than 2 512 bits, and block size can be scaled to any practical length. The function structure is designed for compatibility with any existing 32 or 64 bit microprocessor.
Conventional telephony is far from being ergonomically mature. Users in offices typically still hold a handset to their ear and have a tough time to use their computer simultaneously. Applications where professional SIP softclients are very frequently seen are call centres and service desks. The vast majority of these users take advantage of ergonomic… (More)
We've been able to show recently that Permutable Chebyshev polynomials (T polynomials) defined over the field of real numbers can be used to create a Diffie-Hellman-like key exchange algorithm and certificates. The cryptosystem was theoretically proven to withstand attacks using quantum computers. We additionally prove that attacks based on the inverse of… (More)
A fast and provably secure Polymorphic Block Cipher consisting of a three-round Luby Rackoff Pseudorandom Permutation Generator with a Decorrelation Stage employing a large number of interdependent pseudo-random number generators, combiner routines and permutation functions is proposed. Data-dependent selection of cryptographic primitives with a shared… (More)