Hello to the nice Stackoverflow community!
I have difficulties understanding the difference between the Merkle–Damgård construction and the sponge-function used in KECCAK.
The Merkle–Damgård Construction takes in the message-blocks iteratively, but as of what I've found in descriptions, doesn't a sponge function do the same? Illustrations of both look quite similar and I just don't find an explanation I really understand.
Can someone explain the difference somewhat easier?
So I expanded my search for sources using youtube videos. If someone has the same question, I think it is very well explained in this Video:
https://www.youtube.com/watch?v=IUI5C9stAEM
The explanation starts at minute 18. Hope this helps someone.
Have a nice day!
Related
I think it would help explain the code better, but what do I know, I am just a newbie, an alternative would be little audio notes as code comments.
Is this allowed, possible, desirable, or I am just saying incoherent stuff here?
There would be a lot of practical issues that would make audio notes embedded in source code problematic.
However...
You may be someone who thinks best when speaking to another person, and not someone who finds it natural to articulate their thoughts when writing. If that is the case, find out which text-to-speech converters you like best, and use them to dictate your thoughts. Then embed the text into the program source as comments.
I have been trying to improve my application by incorporating updates. However, the current documentation is very confusing on for example how updates would be structure for a chat or a channel.
Any advice on this topic would be much appreciated. Thank you in advance!
Things have changed a lot, but the official Telethon documentation probably explains them good enough now.
You can also view single-file Telethon examples or real world Telethon projects. Maybe I'm a bit late for the answer but hopefully helps other people :)
I have an exam coming up, and I need to learn a bit more about IDEs (Integretated Development Error).
I have already looked on Wikipedia, and used the Simple English feature, but I haven't really been helped by it, which is why I am here.
If you have any tips I'd appreciate it, because my exam is in 3 weeks. Thanks in advance!
Edit: I also need help on hexadecimal, which I have also seen on Wikipedia, again not being helpful.
I'm currently taking part in a "Data modeling" course. And for my final project, I need to make a research about "R-tree index for spatial searching". However, I'm not at all familiar with many concepts concerning the subject matter (spatial data, multi-dimentional data,...).So, I read the wiki and as I encountered new concepts, I tried to learn them on the way.
However, I don't think this top-down approach is a very efficient way to go about this. Thus, I'd really appreciate it if anybody can suggest a way/lists of things that I need to read up in advance, in order to understand R-tree, and hopefully make some kind of implementation out of it.
Start with the original paper and check out (shameless self promotion) a basic R-Tree implementation in Java.
Can someone please help me understanding which one is more efficient strstr() or KMP as recently I was doing a question on SPOJ and found that strstr() was in one way or other faster than KMP..
someone please explain the mystery behind this..
You are comparing apples with pears, strstr() is a function to find substrings, KMP is an algorithm to do it, so strstr() could theoretically be implemented using KMP. You need to find out which algorithm is the strstr() in question implementing to give a statement.
Take a look at this answer and the comments on it.