the key creation and distribution techniques of an embodiment of the algebro - geometric key establishment system hereof are based on actions of semi - rings on topological monoids . in one embodiment ( referred to as a fractional embodiment ) this action consists of an action of the semi - ring of positive integers on the semi - open unit interval by multiplication followed by evaluation of fractional parts of real numbers . more specifically , the fractional m × n - dimensional embodiment of the system hereof is based on the operation of multiplication of real matrices by integer matrices and on the operation of evaluating fractional parts of coefficients of resulting matrices . in more advanced implementations the operation of evaluating fractional parts can be replaced by the exponentiation from the compact lie algebra into the corresponding compact lie group . in another embodiment ( referred to as a tropical embodiment ) this action consists of a multiplication in the semi - ring consisting of all real numbers and the ideal element +∞ with the tropical addition and multiplication : x ⊕ y = min ( x , y ), x ∘ y = x + y ; more specifically , the tropical m × n - dimensional embodiment of the system hereof is based on the operation of the tropical multiplication of matrices which coefficients are reals or +∞. a preferred exemplary embodiment of such an apparatus is depicted with block diagram in fig1 , and is described as follows . let x be a commutative topological monoid whose law of composition x × x → x is feasibly computable . there are among such monoids a tropical one ( based on the real numbers and +∞), commutative topological groups , e . g ., commutative compact topological groups such as closed commutative subgroups in the special orthogonal groups or in the unitary groups . the block 101 generates such commutative topological monoids . since each such monoid has uncountably many elements , the block 102 selects an element g of x essentially at random . the block 103 generates an m × n matrix g =( g ij ) which coefficients g ij belong to to x . the block 104 is designed for the action of a m × m matrix a =( a ik ) which coefficients belong to a given semi - ring a on the m × n matrix g , which procedure is depicted in more details in fig2 . the block 105 is designed for the action of a n × n matrix b =( b lj ) which coefficients belong to the semi - ring a on the m × n matrix g , which procedure is depicted in more details in fig3 . the block 106 rounds ( if necessary ) each element g of the monoid x to the nearest element [ g ] of x . this procedure is depicted in more details in the subsequent flow diagram of fig7 where , as a preferred fractional embodiment of the invention hereof , the monoid x is a group , which operation consists of taking the fractional part of sum of real numbers . the block 107 applies the procedure of rounding of the block 106 to each coefficient of a given m × n matrix g =( g ij ). fig2 represents a basic procedure of the left action of an m × m matrix a =( a ik ) on an m × n matrix g =( g ij ). in the block 201 an m × n matrix g =( g ij ) which coefficients belong to the topological monoid x is generated . independently , in the block 202 an m × m matrix a with coefficients in a given semi - ring a is generated . and , in the block 203 the m × n matrix a ( g ) is computed according to the formula : g ′ ij = ∑ k = 1 m ⁢ a ik ⁡ ( g kj ) ; fig3 represents a basic procedure of the right action of an n × n matrix b =( b lj ) on an m × n matrix g =( g ij ). in the block 301 an m × n matrix g =( g ij ) which coefficients belong to the topological monoid x is generated . independently , in the block 302 an n × n matrix b with coefficients in a given semi - ring a is generated . and , in the block 303 the m × n matrix ( g ) b is computed according to the formula : g ″ ij = ∑ l = 1 n ⁢ ( g il ) ⁢ b lj fig4 represents a basic procedure of implementing the routine of fig2 in the case when the monoid operation consists of taking the fractional part of sum of real numbers . in the block 401 a real m × n matrix g =( g ij ) is generated . independently , in the block 402 an integer m × m matrix a is generated . and , in the block 403 the fractional product { a · g } is computed according to the formula : { a · g } = ( g ′ ij ) , g ′ ij = { ∑ k = 1 m ⁢ a ik ⁢ g kj } for i = 1 , 2 , . . . , m , and j = 1 , 2 , . . . , n , where { z } stands for the fractional part of the real number z ( for example , { 1 . 7 }= 0 . 7 , {− 1 . 7 }= 0 . 3 ). fig5 represents a basic procedure of implementing the routine of fig3 in the case when the monoid operation consists of taking the fractional part of sum of real numbers . in the block 501 a real m × n matrix g =( g ij ) is generated . independently , in the block 502 an integer n × n matrix b is generated . and , in the block 503 the fractional product { g · b } is computed according to the formula : { g · b } = ( g ″ ij ) , g ″ ij = { ∑ l = 1 n ⁢ g il ⁢ b lj } fig6 represents a basic procedure of implementing the routine of fig2 in the case when the monoid operation is tropical , i . e ., it consists of taking the minimum two real numbers . in the block 601 a real m × n matrix g =( g ij ) is generated . independently , in the block 602 a real m × m matrix a is generated . and , in the block 603 the tropical product a ∘ g is computed according to the formula : g ′ ij = min 1 ≤ k ≤ m ⁢ ( a ik + g kj ) fig7 represents a basic procedure of implementing the routine of fig2 in the case when the monoid operation is tropical , i . e ., it consists of taking the minimum two real numbers . in the block 701 a real m × n matrix g =( g ij ) is generated . independently , in the block 702 a real n × n matrix b is generated . and , in the block 703 the tropical product g ∘ b is computed according to the formula : g ″ ij = min 1 ≤ l ≤ n ⁢ ( g il + b lj ) fig8 illustrates creation , establishment , and distribution of an algebro - geometric key in the preferred embodiment of the system of the present invention . it refers to the routines illustrated by other referenced flow diagrams ( fig1 , fig2 , fig3 , fig4 , fig5 , fig6 , fig7 ) which describe features in accordance with an embodiment of the invention . the block 801 represents choosing at random a public m × n matrix g =( g ij ), which coefficients belong to the public commutative topological monoid x . this g is to be used by both communicating parties . the block 802 represents the routine that can be used by the first communicating party for generating a private matrix a according to the routine of fig2 . similarly , the block 803 represents the routine that can be used by the second communicating party for generating a private matrix b according to the routine of fig3 . the block 804 represents computation ( by the first communicating party ) of the m × n matrix a ( g ) according to the routine of fig2 , and rounding ( if necessary ) the matrix a ( g ) to the nearest m × n matrix [ a ( g )]. the rounded m × n matrix [ a ( g )] is then transmitted over an open ( public ) channel to the second communicating party . similarly , the block 805 represents computation ( by the second communicating party ) of the m × n matrix ( g ) b according to the routine of fig3 , and rounding ( if necessary ) the matrix ( g ) b to the nearest m × n matrix [( g ) b ]. the rounded m × n matrix [( g ) b ] is then transmitted over an open ( public ) channel to the first communicating party . the block 806 represents the routine that can be used by the second communicating party for generating the m × n matrix ([ a ( g )]) b ( according to the routine of fig2 ) and rounding it to the nearest m × n matrix [([ a ( g )]) b ]. similarly , the block 807 represents the routine that can be used by the first communicating party for generating the m × n matrix a ([( g ) b ]) ( according to the routine of fig3 ) and rounding it to the nearest m × n matrix [ a [( g ) b ]]. by the design , the m × n matrices [([ a ( g )]) b ] and [ a ([( g ) b ])] are equal , and thus comprise the common secret algebro - geometric key in possession of both communicating parties . fig9 represents creation , establishment , and distribution of a key in the fractional embodiment of the algebro - geometric key establishment system of present invention . first , public natural numbers d , n , k are generated in the block 901 . next , a public real m × n matrix g =( g ij ) is generated in such a way that each g ij is a fractional decimal number having d + 2n + k +┌ log 10 ( mn )┐ digits after dot ( where ┌ z ┐ denotes rounding of a real number z to the smallest integer greater than z ) is generated in the same block 901 . then in the block 902 , a private integer matrix a is generated according to routines of fig2 and fig4 ( in this case the semi - ring a is the ring of all integers ). in a similar manner , in the block 903 a private integer matrix b is generated according to routines of fig3 and fig5 ( in this case the semi - ring a is the ring of all integers ). in the block 904 the fractional m × n matrix { a · g } is computed according to the routine of fig4 . next , each coefficient of the m × n matrix { a · g } is rounded to d + n + k +┌ log 10 ( mn )┐ decimal places . the rounded fractional m × n matrix { a · g } is then transmitted to the second communicating party . in a similar manner , in the block 905 the fractional m × n matrix { g · b } is computed according to the routine of fig5 . next , each coefficient of the m × n matrix { g · b } is rounded to d + n + k +┌ log 10 ( mn )┐ decimal places . the rounded fractional m × n matrix { g · b } is then transmitted to the second communicating party . the block 906 represents the routine that can be used by the second communicating party for computing the fractional m × n matrix {{ a · g }· b }. the loop 908 is used in the case when the m × n matrix {{ a · g }· b } is not ( k , d )- consistent ( that is , in the case when the sequence of the digits a k + 1 , a k + 2 , . . . a k + d of at least one coordinate of the m × n matrix {{ a · g }· b } is either 0 , 0 , . . . , 0 or 9 , 9 , . . . , 9 .) the loop 708 is continued until the m × n matrix {{ a · g }· b } becomes ( k , d )- consistent . [ the probability of a m × n matrix {{ a · g }· b } to be not ( k , d )- consistent is extremely low . namely , this probability is measured as at most 1 −( 1 − 2 · 10 − d ) mn . the probability of the need for the second run of the loop 908 is measured as at most ( 1 −( 1 − 2 · 10 − d ) mn ) 2 ]. the block 910 is then entered , this block represents the generation of a m × n matrix s which is the rounding of the ( k , d )- consistent m × n matrix {{ a · g }· b } to k decimal places . in a similar manner the block 907 represents the routine that can be used by the first communicating party for computing the fractional m × n matrix { a ·{ g · b }}. the loop 909 is used in the case when the m × n matrix { a ·{ g · b }} is not ( k , d )- consistent ( that is , in the case when the sequence of the digits a k + 1 , a k + 2 , . . . a k + d of at least one coordinate of the m × n matrix { a ·{ g · b }} is either 0 , 0 , . . . , 0 or 9 , 9 , . . . , 9 .) the loop 709 is continued until the m × n matrix { a ·{ g · b }} becomes ( k , d )- consistent . [ the probability of a m × n matrix { a ·{ g · b }} to be not ( k , d )- consistent is extremely low . namely , this probability is measured as at most 1 −( 1 − 2 · 10 − d ) mn . the probability of the need for the second run of the loop 709 is measured as at most ( 1 −( 1 − 2 · 10 − d ) mn ) 2 ]. the block 911 is then entered , this block represents the generation of an m × n matrix s ′ which is the rounding of the ( k , d )- consistent m × n matrix { a ·{ g · b }} to k decimal places . by the design , the m × n matrices s and s ′ are equal , and thus comprise the common secret key in possession of both communicating parties . fig1 represents creation , establishment , and distribution of a key in a tropical embodiment of the algebro - geometric key establishment system of present invention . first , in the block 1001 a public real m × n matrix g =( g ij ) is generated . then in the block 1002 , a private real m × m matrix a is generated according to routines of fig2 and fig6 ( in this case a is the semi - ring of all real numbers and the ideal element +∞ with the tropical addition and multiplication : x ⊕ y = min ( x , y ), x ∘ y = x + y ). in a similar manner , in the block 1003 a private real n × n matrix b is generated according to routines of fig3 and fig7 ( in this case a is also the semi - ring of all real numbers and +∞ with the tropical addition and multiplication ). in the block 1004 the tropical product a ∘ g of matrices a and g is computed according to the routine of fig6 . the real m × n matrix a ∘ g is then transmitted to the second communicating party . in a similar manner , in the block 1005 the tropical product g ∘ b of matrices g and b is computed according to the routine of fig7 . the real m × n matrix g ∘ b is then transmitted to the second communicating party . the block 1006 represents the routine that can be used by the second communicating party for computing the real m × n matrix ( a ∘ g )∘ b . in a similar manner the block 1007 represents the routine that can be used by the first communicating party for computing the real m × n matrix a ∘( g ∘ b ). by the design , the m × n matrices ( a ∘ g )∘ b and a ∘( g ∘ b ) are equal , and thus comprise the common secret key in possession of both communicating parties . the system of present invention is a continuous generalization of the diffie - hellman paradigm . therefore , the security of the system hereof is based on the correlation of the continuous and discrete aspects of the systems internal ( secret ) and external ( public ) components . in particular , the security of the fractional embodiment of the system hereof comes from the built - in geometric density of certain sequences of irrational numbers in the semi - open interval [ 0 , 1 ) of the real line . in other words , security is guaranteed by the obvious mathematical fact that there is no any a priori known general distribution pattern for members of certain sequences of irrational numbers . more precisely , let β 1 , β 2 , . . . be a sequence of irrational numbers ( or more generally , of irrational elements of a compact lie group ) and let γ be an irrational number computed with the precision of k decimal places . then any algorithm that recognizes γ as an element of the sequence β 1 , β 2 , . . . and identifies the index n such that γ = β n must work at least c · 10 k units of time where c is an a priori given constant . the security of the tropical embodiment of the system hereof comes from the difficulty of the task of reconstructing , based on the known algebraic structure of a multitude of real numbers , the real numbers comprising the multitude . more precisely , in the n × n tropical embodiment the multitude of choices is estimated as n n 2 . in particular , if n = 10 , the number of choices a cryptanalyst will face is about 10 100 . apparently , approaches that are the closest to the present invention are developed in u . s . pat . no . 5 , 696 , 826 entitled method and apparatus for encrypting and decrypting information using a digital chaos signal by gao , in u . s . pat . no . 6 , 493 , 449 entitled method and apparatus for cryptographically secure algebraic key establishment protocols based on monoids by anshel et al , and in u . s . patent application ser . no . 10 / 605 , 935 entitled geometry - based symmetric cryptosystem method by berenstein and chernyak , and in u . s . patent application ser . no . 10 / 708 , 197 entitled method and apparatus for geometric key establishment protocols based on topological groups by the authors berenstein and chernyak . the idea of using fractional parts of multiples of given irrational numbers is not new in cryptography . these fractional parts were used , for example , in the patent by gao for obtaining uniform distributions of numbers in the unit interval . however , this is perhaps the only similarity between those previous works and the system of the present invention . in the system hereof , fractional parts of multiples of given irrational numbers are never used for obtaining a uniform distribution of numbers , but rather for creation of a deterministic ( non - random ) keys . the idea of using infinite groups and semigroups for key establishment and distribution is relatively new . it is presented in u . s . pat . no . 6 , 493 , 449 by anshel et al . however , the present invention is the first where continuous groups and monoids are used for key establishment and distribution . in u . s . patent application ser . no . 10 / 605 , 935 by berenstein and chernyak the geometric continuity is utilized for constructing private encryption systems . the present invention combines the idea of diffie - hellman protocol of key establishment with the idea of the geometric cryptosystem developed in u . s . patent application ser . no . 10 / 605 , 935 by the authors arkady berenstein and leon chernyak and the idea of the geometric cryptosystem developed in the u . s . patent application ser . no . 10 / 708 , 197 by the authors arkady berenstein and leon chernyak . an embodiment of the system hereof ( to be referred as a fractional 2 × 2 - dimensional embodiment ) deals with a publicly chosen real 2 × 2 matrix g and a pair of secret integer 2 × 2 matrices a and b , where the matrix a is generated by the first communicating party and the matrix b — by the second communicating party . absolute values matrix coefficients of these matrices are bounded by a publicly available constant 10 n that may be arbitrarily big . thus the keys created and distributed by the system hereof can be of any given in advance size . a fractional 2 × 2 - dimensional embodiment of the system hereof works with a 2 × 2 matrix g of the form where g 11 , g 12 , g 21 , g 22 are real numbers ; and with 2 × 2 matrices a and b of the form : where a 11 , a 12 , a 21 , a 22 are non - negative integers ; and and where b 11 , b 12 , b 21 , b 22 are non - negative integers . absolute values of each integer a 11 , a 12 , a 21 , a 22 , b 11 , b 12 , b 21 , b 22 are bounded by a publicly available constant 10 n that may be arbitrarily big . thus the keys created and distributed by the system hereof can be of any given in advance size . in this embodiment the 2 × 2 matrix g has coefficients g 11 , g 12 , g 21 , g 22 which are arbitrary real numbers , that is , g is an arbitrary point of the 4 - dimensional space . let { x } be the fractional part of a real number x . by definition , for each real number x , the fractional part { x } is given by : where [ x ] is the integer part of x , that is , [ x ] is the greatest integer that is less or equal x . if the numbers a 0 , a 1 and b 0 , b 1 are integers having at most n decimal digits each ( that is , | a 11 |& lt ; 10 n , | a 12 |& lt ; 10 n , | a 21 |& lt ; 10 n , | a 22 |& lt ; 10 n and | b 11 |& lt ; 10 n , | b 12 |& lt ; 10 n , | b 21 |& lt ; 10 n , | b 22 |& lt ; 10 n ) and each coordinate of the following 2 × 2 matrices { a · g } = [ { a 11 ⁢ g 11 + a 12 ⁢ g 21 } { a 11 ⁢ g 12 + a 12 ⁢ g 22 } { a 21 ⁢ g 11 + a 22 ⁢ g 21 } { a 21 ⁢ g 12 + a 22 ⁢ g 22 } ] { g · b } = [ { g 11 ⁢ b 11 + g 12 ⁢ b 21 } { g 11 ⁢ b 12 + g 12 ⁢ b 22 } { g 21 ⁢ b 11 + g 22 ⁢ b 21 } { g 21 ⁢ b 12 + g 22 ⁢ b 22 } ] is rounded to d + n + k + 1 decimal places after dot ( where d , n , and k are natural numbers each greater than 1 ), then the created and distributed key , which is the 2 × 2 matrix { a · g · b }, in each of its coordinates will have k correct decimal places after the dot . these 2k correct digits can serve as an encryption / decryption key of a cryptosystem . the security of this two - dimensional embodiment is further enhanced even in comparison with the high security of the one - dimensional embodiment . in creating algebro - geometric key establishment system in accordance with the 2 - dimensional embodiment hereof , a first step is to choose publicly available parameters of the system : a real 2 × 2 matrix g and natural numbers d , n , k , each greater than 1 , where d stands for the size of the error control buffer , n stands for the maximum number of decimal places in each secret parameter a and b , and k stands for the key length . this embodiment of the algebro - geometric key establishment system hereof relies on the concept of ( k , d )- consistent matrices . an infinite decimal fraction δ = 0 . a 1 , a 2 a 3 . . . is said to be ( k , d )- consistent if the sequence of the digits a k + 1 , a k + 2 , . . . , a k + d is neither 0 , 0 , . . . , 0 nor 9 , 9 , . . . , 9 . we say that a matrix g is ( k , d )- consistent both x 1 and x 2 are ( k , d )- consistent numbers . to implement the key creation and key distribution of this example , the first communicating party , call it alice , chooses a secret integer 2 × 2 matrix a each coefficient of which is between − 10 n and 10 n ( i . e ., each of these four coefficients has at most n decimal places ). then alice calculates the 2 × 2 matrix y ={ a · g } by the formula : y = { a · g } = [ { a 11 ⁢ g 11 + a 12 ⁢ g 21 } { a 11 ⁢ g 12 + a 12 ⁢ g 22 } { a 21 ⁢ g 11 + a 22 ⁢ g 21 } { a 21 ⁢ g 12 + a 22 ⁢ g 22 } ] and then rounds each coefficient of y to d + n + k + 1 decimal places ; and sends so rounded matrix [ y ] to the second communicating party , call it bob . [ it is assumed in this example that alice and bob share the publicly available parameters g and d , n , k .] simultaneously and independently bob chooses a secret integer 2 × 2 matrix a each coefficient of which is between − 10 n and 10 n ( i . e ., each of these four coefficients has at most n decimal places ). then bob calculates the 2 × 2 matrix z ={ g · b } by the formula : z = { g · b } = [ { g 11 ⁢ b 11 + g 12 ⁢ b 21 } { g 11 ⁢ b 12 + g 12 ⁢ b 22 } { g 21 ⁢ b 11 + g 22 ⁢ b 21 } { g 21 ⁢ b 12 + g 22 ⁢ b 22 } ] and then rounds each coefficient of z rounded to d + n + k decimal places ; and sends so rounded matrix [ z ] to alice . upon receiving the 2 × 2 matrix [ y ] from alice , bob calculates the matrix k ={[ y ]· b } by the formula : k = [ { ( a 11 ⁢ g 11 + a 12 ⁢ g 21 ) ⁢ b 11 + ( a 11 ⁢ g 12 + a 12 ⁢ g 22 ) ⁢ b 21 } { ( a 11 ⁢ g 11 + a 12 ⁢ g 21 ) ⁢ b 12 + ( a 11 ⁢ g 12 + a 12 ⁢ g 22 ) ⁢ b 22 } { ( a 21 ⁢ g 11 + a 22 ⁢ g 21 ) ⁢ b 11 + ( a 21 ⁢ g 12 + a 22 ⁢ g 22 ) ⁢ b 21 } { ( a 21 ⁢ g 11 + a 22 ⁢ g 21 ) ⁢ b 12 + ( a 21 ⁢ g 12 + a 22 ⁢ g 22 ) ⁢ b 22 } ] if the matrix k is ( k , d )- consistent then bob calculates the algebro - geometric key s by rounding each matrix coefficient of k to k decimal places . otherwise , he restarts the protocol . upon receiving the 2 × 2 matrix [ z ] from bob , alice calculates the 2 × 2 matrix k ′={ a ·[ z ]} by the formula : k ′ = [ { a 11 ⁡ ( g 11 ⁢ b 11 + g 12 ⁢ b 21 ) + a 12 ⁡ ( g 21 ⁢ b 11 + g 22 ⁢ b 21 ) } { a 11 ⁡ ( g 11 ⁢ b 12 + g 12 ⁢ b 22 ) + a 12 ⁡ ( g 21 ⁢ b 12 + g 22 ⁢ b 22 ) } { a 21 ⁡ ( g 11 ⁢ b 11 + g 12 ⁢ b 21 ) + a 22 ⁡ ( g 21 ⁢ b 11 + g 22 ⁢ b 21 ) } { a 11 ⁡ ( g 11 ⁢ b 12 + g 12 ⁢ b 22 ) ⁢ a 21 + a 22 ⁡ ( g 21 ⁢ b 12 + g 22 ⁢ b 22 ) } ] if the matrix k ′ is ( k , d )- consistent then alice calculates the algebro - geometric key s ′ by rounding each coefficient of k ′ to k decimal places . otherwise , she restarts the protocol . the mathematical argument presented below proves that the algebro - geometric key s in possession of bob equals the algebro - geometric key s ′ in possession of alice . in those ( extremely rare ) cases when k is not ( k , d )- consistent , the algebro - geometric key has to be redistributed because otherwise it may happen that s ≠ s ′. in order to avoid such a situation , alice and bob choose new secret integer 2 × 2 matrix a ′ and b ′ respectively ( while keeping the same g and d , n , k ) and repeat the above steps until they get a new algebro - geometric key s = s ′ ( provided that the new matrix k is ( k , d )- consistent ). the probability of the need for such redistribution is extremely low and is measured as at most 1 −( 1 − 2 · 10 − d ) 4 the probability of the need for the second key distribution is measured as at most ( 1 −( 1 − 2 · 10 − d ) 4 ) 2 . the embodiment of the system hereof is based on the following mathematical argument . proposition . let be p =( p ij ), q =( q ij ), and l =( l ij ) be m × n matrices of natural numbers . let α =( α ik ) be an arbitrary m × m matrix with natural coefficients and let β =( β lj ) be an arbitrary n × n matrix with natural coefficients such that : where p *=( 1 / p ij ), q *=( 1 / q ij ), l *=( 1 /( l ij )), and the m × n matrix inequality y ≦ z is equivalent to m · n scalar inequalities : y ij ≦ z ij . then for any integer m × m matrix a , any integer m × n matrix b satisfying | a ik |& lt ; α ik , | b lj |& lt ; β lj ( i , k = 1 , 2 , . . . , m , j , l = 1 , 2 , . . . , n ) one has : either at least one matrix coefficient of [{([{ a · g }] p )· b }] l equals 0 , or at least one matrix coefficient of [{([{ g · b }] q )· a }] l equals 0 , or − l *& lt ;{([{ a · g }] p )· b }−{( a ·[{ g · b }] q )}& lt ; l *. [{ a · g }] p ={ a · g }+ θ 1 , [{ g · b }] q ={ g · b }+ θ 2 , where θ 1 and θ 2 are m × n matrices such that − ½p *≦ θ 1 ≦ ½p * and − ½q *≦ θ 2 ≦ ½q *. therefore , ([{ a · g }] p )· b =({ a · g }+ θ 1 )· b ={ a · g }· b + θ 1 · b ={ a · g }· b + e 1 , a ·([{ g · b }] q )= a ·({ g · b }+ θ 2 · q − 1 )= a ·{ g · b }+ a · θ 2 = a ·{ g · b }+ e 2 , | e 1 |=| θ 1 · b |≦ ½ ·| p *· b |& lt ; ½ · p *· β ≦ ½ · l *, | e 2 |=| a · θ 2 |≦ ½ ·| a · q *|& lt ; ½ · q *· α ≦ ½ · l *. in its turn , this implies that either at least one matrix coefficient in |([{ a · g }] p )· b | is not greater than the corresponding coefficient of l */ 2 or |([{ a · g }] p )· b |& gt ; l */ 2 and : similarly , the above implies that either at least one matrix coefficient in | a ·([{ g · b }] q )| is not greater than the corresponding coefficient of l */ 2 or | a ·([{ g · b }] q )|& gt ; l */ 2 and : { a ·([{ g · b }] q )}={ a ·{ g · b }+ e 2 }={ a ·{ g · b }}+ e 2 ={ a · g · b }+ e 2 . a real m × n matrix x =( x ij ) is said to be ( k , d )- consistent if : where c = ½ − 1 /( 2d ) and 1 mn is the m × n matrix in which all matrix coefficients are equal 1 . corollary . in the notation of proposition , if l = d · k and one the m × n matrices {([{ a · g }] p )· b }, { a ·([{ g · b }] q )} is ( k , d )- consistent then [([{ a · g }] p )· b ] k =[ a ·([{ g · b }] q )] k . for the 2 × 2 - dimensional embodiment of the system hereof the corollary is applied with m = n = 2 , k 11 = k 12 = k 21 = k 22 = k . therefore , the corollary guarantees that s = s ′ in the protocol . in creating an algebro - geometric key establishment system in accordance with the 2 × 2 - dimensional embodiment hereof ( and with the following small numbers for ease of illustration ), a first step is to choose publicly available parameters of the system : a 2 × 2 matrix g and integer parameters d , n , k greater than 1 each . next , suppose that alice chooses a secret integer 2 × 2 matrix a : alice calculates the 2 × 2 matrix y =[{ a · g }] each element of which rounded to d + n + k + 1 = 9 decimal places : y = [ { a · g } ] = [ 0 . 595265912 0 . 504847176 0 . 715059661 0 . 574272410 ] suppose that at the same time bob chooses a secret integer 2 × 2 matrix b : bob calculates the 2 × 2 matrix z =[{ g · b }] each element of which rounded to d + n + k + 1 = 9 decimal places : z = [ { g · b } ] = [ 0 . 476448804 0 . 366264602 0 . 725416006 0 . 620588401 ] upon receiving the 2 × 2 matrix y from alice , bob calculates the 2 × 2 matrix k =[{ y · b }] with the precision k + d = 5 decimal places after dot : k = [ { y · b } ] = [ 0 . 39290 0 . 03885 0 . 89633 0 . 88824 ] since this 2 × 2 matrix is ( k , d )- consistent , the 2 × 2 matrix k , after having been rounded to the first k = 3 digits of each element , constitutes the algebro - geometric key in possession of bob : upon receiving the 2 × 2 matrix z from bob , alice calculates the 2 × 2 matrix k ′=[{ a ·[ z ]}] with the precision k + d = 5 decimal places after dot : k ′ = [ { a · z } ] = [ 0 . 39290 0 . 03885 0 . 89633 0 . 88824 ] since this each element of this 2 × 2 matrix is ( k , d )- consistent the 2 × 2 matrix k ′, after having been rounded to the first k = 3 digits of each element , constitutes the algebro - geometric key in possession of alice : thus , the 2 × 2 matrix s = s ′ is the algebro - geometric key shared by alice and bob . this key can be used in any major symmetric cryptosystem . another embodiment of the system hereof ( to be referred as a tropical 2 × 2 - dimensional embodiment ) deals with a publicly chosen real 2 × 2 matrix g and a pair of secret real 2 × 2 matrices a and b , where the matrix a is generated by the first communicating party and the matrix b — by the second communicating party . the matrix coefficients of these matrices and the keys created and distributed by the system hereof can be of any given in advance size . a tropical 2 × 2 - dimensional embodiment of the system hereof works with a 2 × 2 matrix g of the form where g 11 , g 12 , g 21 , g 22 are real numbers ; and with 2 × 2 matrices a and b of the form : a = [ a 11 a 12 a 21 a 22 ] b = [ b 11 b 12 b 21 b 22 ] where a 11 , a 12 , a 21 , a 22 are real numbers ; and b 11 , b 12 , b 21 , b 22 are real numbers . to implement the key creation and key distribution of this embodiment , the first communicating party , call it alice calculates the 2 × 2 matrix y ={ a · g } by the formula : y = a ∘ g = [ min ⁡ ( a 11 + g 11 , a 12 + g 21 ) min ⁡ ( a 11 + g 12 , a 12 + g 22 ) min ⁡ ( a 21 + g 11 , a 22 + g 21 ) min ⁡ ( a 21 + g 12 , a 22 + g 22 ) ] and sends y to the second communicating party , call it bob . [ it is assumed that alice and bob share the publicly available parameter g ]. simultaneously and independently bob calculates the 2 × 2 matrix z = g ∘ b by the formula : z = g ∘ b = [ min ⁡ ( g 11 + b 11 , g 12 + b 21 ) min ⁡ ( g 11 + b 12 , g 12 + b 22 ) min ⁡ ( g 21 + b 11 , g 22 + b 21 ) min ⁡ ( g 21 + b 12 , g 22 + b 22 ) ] upon receiving the 2 × 2 matrix y from alice , bob calculates the matrix k = y ∘ b by the formula : s = y ∘ b = [ min ⁡ ( y 11 + b 11 , y 12 + b 21 ) min ⁡ ( y 11 + b 12 , y 12 + b 22 ) min ⁡ ( y 21 + b 11 , y 22 + b 21 ) min ⁡ ( y 21 + b 12 , y 22 + b 22 ) ] upon receiving the 2 × 2 matrix z from bob , alice calculates the 2 × 2 matrix k ′= a ∘ z by the formula : s ′ = a ∘ z = [ min ⁡ ( a 11 + z 11 , a 12 + z 21 ) min ⁡ ( a 11 + z 12 , a 12 + z 22 ) min ⁡ ( a 21 + z 11 , a 22 + z 21 ) min ⁡ ( a 21 + z 12 , a 22 + z 22 ) ] s = s ′ = [ min ( a 11 + g 11 + b 11 , a 11 + g 12 + b 21 , a 12 + g 21 + b 11 , a 12 + g 22 + b 21 ) min ( a 11 + g 11 + b 12 , a 11 + g 12 + b 22 , a 12 + g 21 + b 12 , a 12 + g 22 + b 22 ) min ( a 21 + g 11 + b 11 , a 21 + g 12 + b 21 , a 22 + g 21 + b 11 , a 22 + g 22 + b 21 ) min ( a 21 + g 11 + b 12 , a 21 + g 12 + b 22 , a 22 + g 21 + b 12 , a 22 + g 22 + b 22 ) ] thus , the algebro - geometric key s in possession of bob equals the algebro - geometric key s ′ in possession of alice . in creating an algebro - geometric key establishment system in accordance with the tropical 2 × 2 - dimensional embodiment hereof ( and with the following small numbers for ease of illustration ), a first step is to choose publicly available parameters of the system : a 2 × 2 matrix g . next , suppose that alice chooses a secret real 2 × 2 matrix a : y = a ∘ g = [ min ( √ 123 + √ 2 , √ 456 + √ 5 ) min ( √ 123 + √ 3 , √ 456 + √ 7 ) min ( √ 817 + √ 2 , √ 391 + √ 5 ) min ( √ 817 + √ 3 , √ 391 + √ 7 ) ] = [ √ 123 + √ 2 √ 123 + √ 3 √ 391 + √ 5 √ 391 + √ 7 ] suppose that at the same time bob chooses a secret integer 2 × 2 matrix b : z = g ∘ b = [ min ( √ 2 + √ 691 , √ 3 + √ 529 ) min ( √ 2 + √ 378 , √ 3 + √ 109 ) min ( √ 5 + √ 691 , √ 7 + √ 529 ) min ( √ 5 + √ 378 , √ 7 + √ 109 ) ] = [ √ 3 + √ 529 √ 3 + √ 109 √ 7 + √ 529 √ 7 + √ 109 ] upon receiving the 2 × 2 matrix y from alice , bob calculates the 2 × 2 matrix s = y ∘ b : s = y ∘ b = [ min ( √ 123 + √ 2 + √ 691 , √ 123 + √ 3 + √ 529 ) min ( √ 123 + √ 2 + √ 378 , √ 123 + √ 3 + √ 109 ) min ( √ 391 + √ 5 + √ 691 , √ 391 + √ 7 + √ 529 ) min ( √ 391 + √ 5 + √ 378 , √ 391 + √ 7 + √ 109 ) ] = [ √ 123 + √ 3 + √ 529 √ 123 + √ 3 + √ 109 √ 391 + √ 7 + √ 529 √ 391 + √ 7 + √ 109 ] the 2 × 2 matrix s constitutes the algebro - geometric key in possession of bob : s = [ √ 123 + √ 3 + √ 529 √ 123 + √ 3 + √ 109 √ 391 + √ 7 + √ 529 √ 391 + √ 7 + √ 109 ] upon receiving the 2 × 2 matrix z from bob , alice calculates the 2 × 2 matrix s ′= a ∘ z : s ′ = a ∘ z = [ min ( √ 123 + √ 3 + √ 529 , √ 456 + √ 7 + √ 529 ) min ( √ 123 + √ 3 + √ 109 , √ 456 + √ 7 + √ 109 ) min ( √ 817 + √ 3 + √ 529 , √ 391 + √ 7 + √ 529 ) min ( √ 817 + √ 3 + √ 109 , √ 391 + √ 7 + √ 109 ) ] = [ √ 123 + √ 3 + √ 529 √ 123 + √ 3 + √ 109 √ 391 + √ 7 + √ 529 √ 391 + √ 7 + √ 109 ] the 2 × 2 matrix s ′ constitutes the algebro - geometric key in possession of alice : s ′ = [ √ 123 + √ 3 + √ 529 √ 123 + √ 3 + √ 109 √ 391 + √ 7 + √ 529 √ 391 + √ 7 + √ 109 ] thus , the 2 × 2 matrix s = s ′ constitutes the algebro - geometric key shared by alice and bob . this key can be used in any major symmetric cryptosystem . the invention has been described with reference to a particular preferred embodiment , but variations within the spirit and scope of the invention will occur to those skilled in the art . for example , it will be understood that the public information g , d , n , k of the system can be stored on any suitable media , for example a “ smart card ,” which can be provided with a microprocessor capable of performing arithmetic operations so that the keys can be distributed to and / or from the smart card .