Many cryptographic techniques rely on prime numbers.
Their power comes from the virtual impossibility of
factoring a product of two very large prime numbers.
Data Shaping Solutions offers an alternative to traditional
cryptography. The detail of our algorithm are confidential.
But you will find below
interesting anecdotal results
related to prime numbers.
The function illustrated in the above graph has the following properties:
It belongs to a broad class of prime-generating functions
investigated in our laboratory. Additional material can be found
on our mathematical contest page.
- It takes value between 0 and 1.
- It is equal to zero if and only if the argument is a prime number greater than 2.
- It is equal to one if and only if the argument is a composite number.
- It is a continuous function.
- The formula to compute this function is purely analytical, involving simple trigonometric
functions and a finite number of power transformations. In particular, it does not
involve prime numbers, nor moduli or divisors.