I am interested in algorithms that consume as less space available on a memory, for low consuming power devices such as wireless nodes. From a search I have found this article here:


I have read it but I cannot understand where it is based in order to provide security. It is not the common discrete logarithm problem, elliptic curves etc. Can this scheme, as it is described in the paper, work in other circumstances?

  • $\begingroup$ What I am asking is very new and the information I ask are very little over google, I cannot understand the downvoting.... $\endgroup$
    – someone
    Jan 9, 2020 at 14:19
  • 1
    $\begingroup$ A read of the intro gives "random key pre-distribution scheme". You can even find a Wikipedia link on this. $\endgroup$
    – Binou
    Jan 9, 2020 at 21:52
  • 1
    $\begingroup$ Please do follow up on your answers and don't ask questions that don't show prior effort. I see you haven't accepted any answer on any SE site. That's not considered proper conduct. And please do not cross post. $\endgroup$
    – Maarten Bodewes
    Jan 9, 2020 at 23:12


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.