kronxe

Font Engine is one of the first apps of Tasarla project, which recommends fonts based on your needs. You can type a text with those fonts after Font Engine suggests those fonts to you. If you like a font type, you can click the link icon and go to the font website.

Font Engine is currently in an experimental version, so some results may not meet your expectations. These can only be improved with your feedback.

Well-Curated 70+ Free Gradient Backgrounds for Designers and Developers. Easy to use, easy to copy css of gradient.

ProductHunt page: https://www.producthunt.com/posts/gradient-palette

Instagram: https://www.instagram.com/tasarlalabs/

I think maybe I cannot explain clearly, I dont have a claim like this my encryption algorithm is safest, fastest, best algorithm on the earth. I tried to make an 'unique' algorithm (as you call home made :) ) in an hour. I shared it in order to show there should be different approaches to encryption algorithm because if algorithm working principles are known and predictable, then algorithm safety level decrease. I think you tried to approach cryptography by an academic perspective (more stable solutions) but I tried to avoid stoling of the data.

By the way, I mentioned N=NP due to show probably in a few years there is solution of this problem and maybe the end of the bitcoin [1].

As your claim about brute-forcability, I want to say quantum computing is experimental right now but there is working machine and proccesing units of them. In other words, it is not only theoretical and Quantum computing age probably allows to crack these all algorithms probably mine as well with Quantum AI. However, in my opinion, if people do not know how your algorithms work, the attacking possibility is dramatically decreases.It is more difficult to target something unknown.

[1] https://gizmodo.com/if-you-solve-this-math-problem-you-could...

I dont want to discuss this issue too much but maybe you can check that what is the ongoing problems about bitcoin's p=np problem, is 2140 a realistic target and is your calculation still applicable for today.

Also, I recommend you to read Google's quantum paper and quantum attacks on some sort of cryptography things.

If we think about today, we cannot catch up new techs, we should think about future. That is why technology is growing exponential.

I see and I understand your point but I want to say the cllasical approaches are more stable but more unsafe. By the way, there is no something that non brute-forcable today, increasing proccesing power and quantum computing allows it. I think we look some different specific fields. 'Home-made' algorithms certainly gives much more safety because people cannot attack if they dont know how it works. For example, in my algorithm I used ideas of prime numbers and also changing the order of the characters but maybe some other people use turn bytes into bcd values and than make some change for complexity. My algorithm is one of the example of trying to use some other method different than standard encryption with key.

Basically hash functions are not reversible that is why we call them as cryptographic hash function and my algorithm is cryptographic encryption function (which has a reverse). Also digital signature has a math behind I could not understand what the problem is here. [1]

> Your claim suggests that you are not familiar with cryptography at all. Modern cryptographic algorithms are parameterized with keys in a way that knowing the algorithm doesn't give adversaries much hint---you just have to keep keys safe. By comparison knowing that your algorithm is in use allows the complete decryption.

Have you got an experience in data encryption for databases or related ? My point is your function may used by other people, for example: If a hacker reached db of website, and tried to find the keys of encryption. He can make brute force trial to accomplish it or some analysis. There is lots of field that used cryptography like e2e encryption in communication applications or cryp. hash functions like md5 in databases. This field is very broad, it does not focus on just one subject.

[1] https://miro.medium.com/max/1272/1*sc0fhLXdwc2WRzGRDAfkcQ.pn...

In computer science, cryptography refers to secure information and communication techniques derived from mathematical concepts and a set of rule-based calculations called algorithms, to transform messages in ways that are hard to decipher. [https://searchsecurity.techtarget.com/definition/cryptograph...] Basically cryptography means secure plaintext replaced with it by some other thing and you should be able to make inverse replacation proccess as well (decryption) this function should be based on mathematical theories or methods.

I think you are not familiar with the cryptography concepts in general trends because today the most of data breaches become dangerous if the encrpyted part decrypts by the hackers, so that is why we should avoid typical approaches.

Also, your question about complexity, I am sorry but I can not understand. If you have an important data, you should protect it by an well-developed algorithm.

A video explanation (in Turkish): https://www.youtube.com/watch?v=xAfyjI8hT8w

By the way, I want to add something. I do not use any codes in paper but I tested these all in Python and they can be implemented in most languages.

Also, my other point is it is not an stable, constant algorithm. Everyone may have different TBCAs for their specific purposes but there should be generic ideas like human names or in an online game if you give '~' for 'GG' , you can save too many locations in memory. For a chat application, if you change 'hello' to some two bytes and you save both memory and time (because transmission of long bytes takes more than compression process probably if you dont have a huge dictionary).

It is possible and actively used but in this article my point is like an universal engine for ,big data and databases that need speed, as I mentioned in name Type-based. You cannot used a grammar algorithm in only number based data.

Yes I think Markov coding also Markov chains is such good things to learn. But in this article my point is there should be stable dictionary because for big data purposes, especially in databases it is hard to calculate every time new probs.

My one of the main goals is protect the database structure as it is, because in big data age we should get data as fast as possible. I see your point to see this algorithm as a basically some sort of look-up table but actually it is not.

For example, we can think a well-developed city carries all data related to the city and the people to a big database. Then this city uses a TBCA that specialized for only the this big database's needs like a framework or engine method. However, this specific TBCA is not totally different than other TBCAs used in other types of databases like a game database since they have common propertries like people's names and surnames, the structure of a name database is generally same but TBCA plays huge rol in here, you can configure your algorithm with your needs like an optimizing. Today I am not sure how it should be done, maybe with an ML algorithm.

I wrote too much I know but my point is TBCA is not an specific algorithm like gzip or LZW it is a sub branch of compression like an universal set.

In the future, There may communities share their specificated algorithms for some structures and their datasets( frequency analysis). It will becomes a pool that you can choose best engine(structural method) and best dataset(freq. analysis) from there.

These ideas all tested in Python and then I achieved results. I did not add codes because it is a 'philosophical' research for me actually.