jcstill / dbpbe Goto Github PK

Configure automatic build releases via Github.

Speak with @Atargatis-Labs about possibility of writing and publishing a research report on the algorithm. If determined feasible, discuss project outcomes for the research project.

Documentation on source code is needed for future developers planning to add to the project.

For consistency, we plan to use the Javadoc documentation style.

See example of this implementation here.

Unencrypt function sometimes throws errors that the circles don't intersect. Seems to be irregular.

TESTING CONVERTING TO AND FROM DISTANCES
enter data char: a
Data:	1628184479.500000000, 2.780000000
Key1:	3603206327.1196640157, -138434235.4177932994, 1979867504.8801610958
Key2:	4141842997.1674014105, 4035481356.1407939758, 4754323179.6717966804
Key3:	-3589531820.1104717246, -2749184474.2598691715, 5897675700.8178885523
-----------------
1628184479.5000000002, 2.7800000002
5548667958.7918183776, -505931686.5272037383
8381182162.5501095206, 6187594814.4920926364
2782815181.8084990035, 8591426076.3766916767
ERROR: one circle is contained in the other

The Decryption does not work with all characters. May be related to data points being too close together. Possibly relates to issue #1

TESTING CONVERTING TO AND FROM DISTANCES WITH STRINGS MODE: 12
enter string to encrypt: hello world
h:	  -138477048.1200000000, -1751192248.2300000000
e:	  4181663239.8999999999,  1700677087.1899999999
l:	  -474185188.1600000000, -1818545796.3300000000
l:	  -474185188.1600000000, -1818545796.3300000000
o:	   725966293.1700000000, -1869060957.0000000000
 :	 -2685665120.1399999999,  -538828384.3100000000
w:	  1397382573.3100000001,  2003768053.7000000000
o:	   725966293.1700000000, -1869060957.0000000000
r:	  -977747398.2300000000, -1919576118.3000000000
l:	  -474185188.1600000000, -1818545796.3300000000
d:	 -4097736204.8000000000, -1683838700.2500000000

Keys:
0:	 -3103956898.2239118924,  1015321910.2968752290
1:	  3302358380.2560894249, -1945281942.4813867650
2:	  -792068139.6978473222,  3816983449.1042257112

Encrypted Data:
4055572873.3068013105
3446305159.8172010418
5606403652.1974952049
7317784672.6677394998
3750492538.6188568436
5405252672.5283556636
3866071058.0271460970
3778669524.4339952695
5644487527.4043140365
3866071058.0271460970
3778669524.4339952695
5644487527.4043140365
4794577789.2461678572
2577519316.1308354330
5885195793.4771858985
1609456787.1922618542
6150978544.3121804134
4749611168.5538045471
4608587941.7016344802
4384510086.3597195502
2842788155.1078465139
4794577789.2461678572
2577519316.1308354330
5885195793.4771858985
3624140349.9486861713
4280182970.9051992777
5739563786.3365546209
3866071058.0271460970
3778669524.4339952695
5644487527.4043140365
2876293676.1927893879
7404711502.5964999376
6417669801.0619285358

Decrypted Data:
helln wnr

In function genkeypoint() there is an edge case where x and y could be 0:

x = (long long)(((unsigned int)(convert) * (unsigned int)(16785407)) * 5) % 4294967295;
y = (long long)((unsigned int)(convert) * (unsigned int)(16838387));

While this is HIGHLY unlikely as a hash is generated from the input, this does need to be changed.

Configure travis for checking code

Optimize code for fast execution. Not that it is not already fast, but the faster the better....

Research and configure Google Protocol Buffers to work with current version of the project.

Summarizing from their website:

Protocol buffers are Google's language-neutral, platform-neutral, extensible mechanism for serializing structured data – think XML, but smaller, faster, and simpler. You define how you want your data to be structured once, then you can use special generated source code to easily write and read your structured data to and from a variety of data streams and using a variety of languages.

Using C++ implementation, see here.

Change All variables to single data type if possible - this will hopefully fix some errors in typecasting.

This may also help to resolve issue #1

Convert to C or at least make compatible with C (no classes)