To those interested, I'm including the code of a little scheme for key exchange similar to a DH Key exchange process. Under this scheme, where Alice and Bob exchange some numbers that are produced and then recombined by an iterative function that is based on simple bit-wise operations, Eve has to figure out a way to find ant test efficiently pairs of inputs to the core function of this scheme (different combinations of inputs result can produce the same result but you require the same inputs to perform the final combination that provide Alice and Bob with the same key at the end of the process. I'm not making any claims regarding the security of this system, but I believe it can be interesting to spark some discussion about alternatives to current key exchange schemes and their associated mathematical problems. More details and demo source code (in C) is available here: https://github.com/Caume/HerraduraKEx A sample of the output of the demo source code (which should compile without modification in any Linux system) is provided here: ----- ALICE: 15076425430454950481 A [Secret 1] 5065174741009230133 B [Secret 2] 6616145336279823145 D [FSCX_REVOLVE(A,B,16)] -> BOB: A2 5640910407791789943 [Secret 3] B2 2734548036544947114 [Secret 4] <- D2 7953994751009905686 [FSCX_REVOLVE(A2,B2,16)] 11220837854338859672 FA [FSCX_REVOLVE(D2,B,48) xor A] FA = FA2 11220837854338859672 [FSCX_REVOLVE(D,B2,48) xor A2] EVE: NOT (D xor D2)= 14577306244540485824 EVE: D xor D2= 3869437829169065791 EVE: FSCX(D,D2)= 14126811020873148126 EVE: FSCX(D2,D)= 14126811020873148126 EVE: FSCX(D,D2) xor D= 11519582121138542071 EVE: FSCX(D2,D) xor D= 11519582121138542071 ... EVE: FSCX_REVOLVE_PRINT(D,D2,64)= 6616145336279823145 ... ----- Regards, Omar Herrera _______________________________________________ The cryptography mailing list cryptography@metzdowd.com http://www.metzdowd.com/mailman/listinfo/cryptography

On Tue, Dec 19, 2017 at 4:20 PM Omar Herrera Reyna <0h3rr3r4@gmail.com> wrote: > To those interested, > > I'm including the code of a little scheme for key exchange similar to a DH > Key exchange process. Under this scheme, where Alice and Bob exchange some > numbers that are produced and then recombined by an iterative function that > is based on simple bit-wise operations, Eve has to figure out a way to find > ant test efficiently pairs of inputs to the core function of this scheme > (different combinations of inputs result can produce the same result but > you require the same inputs to perform the final combination that provide > Alice and Bob with the same key at the end of the process. > > I'm not making any claims regarding the security of this system, but I > believe it can be interesting to spark some discussion about alternatives > to current key exchange schemes and their associated mathematical problems. > > More details and demo source code (in C) is available here: > https://github.com/Caume/HerraduraKEx > > A sample of the output of the demo source code (which should compile > without modification in any Linux system) is provided here: > > ----- > > ALICE: > 15076425430454950481 A [Secret 1] > 5065174741009230133 B [Secret 2] > 6616145336279823145 D [FSCX_REVOLVE(A,B,16)] -> > BOB: > A2 5640910407791789943 [Secret 3] > B2 2734548036544947114 [Secret 4] > <- D2 7953994751009905686 [FSCX_REVOLVE(A2,B2,16)] > 11220837854338859672 FA [FSCX_REVOLVE(D2,B,48) xor A] > FA = FA2 11220837854338859672 [FSCX_REVOLVE(D,B2,48) xor > A2] > EVE: NOT (D xor D2)= 14577306244540485824 > EVE: D xor D2= 3869437829169065791 > EVE: FSCX(D,D2)= 14126811020873148126 > EVE: FSCX(D2,D)= 14126811020873148126 > EVE: FSCX(D,D2) xor D= 11519582121138542071 > EVE: FSCX(D2,D) xor D= 11519582121138542071 > > ... > > EVE: FSCX_REVOLVE_PRINT(D,D2,64)= 6616145336279823145 > > ... > ----- > > Update: Added an encryption protocol (HAEN) and code, based on HKEX and the FSCX function _______________________________________________ The cryptography mailing list cryptography@metzdowd.com http://www.metzdowd.com/mailman/listinfo/cryptography