• 4 Posts
  • 139 Comments
Joined 2 years ago
cake
Cake day: June 15th, 2023

help-circle






  • I’m a different person weighing in here:

    When you said:

    The T3SS is one of the most complex bacterial molecular machines, incorporating one to over a hundred copies of more than 15 different proteins into a multi-MDa transmembrane complex (Table 1). The system, especially the flagellum, has, therefore often been quoted as an example for “irreducible complexity,” based on the argument that the evolution of such a complex system with no beneficial intermediates would be exceedingly unlikely. However, it is now clear that, far from having evolved as independent entities, many secretion systems share components between each other and with other cellular machineries (Egelman, 2010; Pallen and Gophna, 2007).

    I ofc am just a layman reading this, I agree it seems better understood that how I interpreted what he was saying, but it also doesn’t seem nearly as well understood as you’re saying.

    IMO it’s a problem with the article. The article says that T3SS is cited as an example as something that’s “irreducibly complex”. I suppose that it’s true that it is cited as that. But the second part of the paragraph explains why it isn’t true that it’s “irreducibly complex”. The paragraph isn’t explicit enough because the paragraph has probably evolved to be something that’s true and equally dissatisfying to both sides.





  • Yeah I don’t think there’s any basis to the quote.

    Interestingly the earliest composed Christian document that has been recovered (the didache, the copy we have is from Ca. 1000 CE, but seems to be in the original Greek) condemns infanticide, specifically including by exposure to the elements. It also prohibits private property so the document is not taken authoritatively by many modern christians.






  • So how does generating a one time pad from mutually accessible data fit into this scheme. Is the pad the cipher or the key?

    If two people agreed that the pad would be the output of a particular pRNG given the 3rd paragraph of the second article on the third page of that day’s newspaper as a seed.

    The attack vector would be shortcomings in the pRNG I guess? Which could result in the possibility of some sort of statistical language attack?

    Or the attacker could guess the newspaper text & algorithm.


  • Neat, yeah Wikipedia says steam cipher approximate one time pads but can also be completely insecure.

    I think it would take one hell of an effort to crack, it would be like 3MB encryption right? Or if they guessed the scheme they could try all mp3s ever torrented XOR’ed in every possible combination.

    Idk I think there’s something workable there but I only having a casual knowledge

    Also I think OP wanted pen and paper so maybe use a book instead digital files.


  • I’m certainly not an expert.

    But could you generate pads from mutually accessible data sources?

    Like use hit_me_baby_one_more_time_not_a_virus.mp3 appended with a password, as a seed in a pseudo random number generating algorithm, then do the same thing with another data source, repeat however many times, then XOR the generated numbers together, and use the result as a pad?