and c may be communicated once thereafter new values of k m and r may be generated for each message or alternatively may be periodically updated many variations of the techniques described herein would be readily apparent to one of ordinary skill in the art upon reading this disclosure as described above different types of equations may be used for the key equation further different types of equations may produce different numbers of unknowns for the decryption logic 28 in this regard in the exemplary embodiment described above the key equation included two unknowns m and k for the decryption logic 28 and at least two instances of the key equation are therefore evaluated in order to provide the logic 28 with sufficient information for calculating k in other examples the key equation may have other numbers of unknowns for the logic 28 in such examples other numbers of instances of the key equation may need to be evaluated in order to provide the logic 28 with sufficient information for calculating k an exemplary use and operation of the encryption system 10 will be described below with reference to fig4 initially the values of p g c p s and p r are randomly generated as indicated by block 111 of fig4 in this regard the encryption logic 25 requests four randomly generated numbers from the random number generator 52 which provides the logic 25 with the base numbers p g and c as well as the sender 39 s private number ps which is private to the encryption logic 25 in addition the decryption logic 28 requests a randomly generated number from the random number generator 72.