moyix

59 ms·

631.
by moyix 12y ago
Well, Shannon & Moore showed [1] that you can make arbitrarily reliable circuits out of unreliable relays, so I expect you could find a redundant enough encoding for any program that would allow it to operate at high precision, even in
632.
by moyix 12y ago
In the US, at least, I believe there is no such legal requirement unless the party doing the deleting is aware of pending legal action relevant to the documents being deleted. I'm not a lawyer though and may be wrong.
633.
by moyix 12y ago
The talk at REcon that introduced this tool is also excellent: http://recon.cx/2014/video/recon2014-10-artem-dinaburg-andre...
634.
The Laughing Muggers(medium.com)
1 points by moyix 12y ago|0 comments
635.
by moyix 12y ago
Neat! I wrote a post [1] a while back on the isomorphism between Wang Tilings and Turing machines, which lends itself nicely to visualizations. Wang tilings have been used in other areas of computer graphics as well [2], as well as for DNA
636.
by moyix 12y ago
Small correction: the magic of record-replay is that you don't have to record every piece of data read/written, only the non-deterministic events (interrupts, accesses to devices, and a couple instructions like `rdtsc`). This le
637.
by moyix 12y ago
The script [1] that computes the statistics on the in-memory data actually does use numpy, and perhaps could benefit from using pandas. Sadly I haven't had time to look into it though! [1] https://github.com/moyix/
638.
by moyix 12y ago
Post author here! I wanted to make it clear that the original technique for breaking Spotify DRM is not mine - it was developed by Wang et al. in their excellent paper, Steal This Movie: Automatically Bypassing DRM Protection in Streaming M
639.
Breaking Spotify DRM using Statistics and Dyanamic Analysis(moyix.blogspot.com)
7 points by moyix 12y ago|0 comments
640.
by moyix 12y ago
Actual malice on the part of an AI isn't necessarily required for catastrophic consequences. The canonical example in this school of thought is the Paperclip Maximizer [1]. [1] http://wiki.lesswrong.com/wiki/Pape
641.
by moyix 12y ago
I don't know what the current Windows embedded offering is, but Windows CE has a long history of running on fairly small devices. I've seen it on printers, in-flight entertainment systems, ATMs, oscilloscopes, etc. It's heavi
642.
Biomarkers and ageing: The clock-watcher(nature.com)
58 points by moyix 13y ago|5 comments
643.
by moyix 13y ago
It is sometimes a bit disheartening to see so much development effort go toward the virtualization/KVM/Xen side rather than seeing improvements in TCG. I realize that Redhat (and maybe others?) funds a lot of development in that a
644.
by moyix 13y ago
Gotcha. Sorry to be snippy earlier!
645.
by moyix 13y ago
I'd like to offer a different perspective. You're free to dismiss me as well because I currently have a similar job description to 'djcapelis, but I've also been a sysadmin and front-line IT security guy (watching IDSes,
646.
by moyix 13y ago
Is it so hard to look at the README? > This is tricky. This uses the ssl3_write_bytes() function in order to send heartbeats encrypted after the SSL handshake is complete. This function is sometimes exported in OpenSSL libraries, and som
647.
by moyix 13y ago
Depending on how the exploit is written it can be encrypted or unencrypted. If the heartbeat is sent before the TLS handshake is finished, then the memory contents will be sent in the clear. If it is sent after the handshake is finished (
648.
by moyix 13y ago
One important thing to realize about the PoC -- if you change "40 00" to "FF FF" or similar, it may seem that you still only get 16KB back. In fact (in violation of the TLS spec) OpenSSL is just fragmenting heartbeat mes
649.
by moyix 13y ago
I set up something similar as a honeypot, to see who was out scanning. I made the heartbeat response "leak" a fragment of an HTTP request with a username and password, as well as a (freshly generated) DER encoded RSA private key.
650.
by moyix 13y ago
I think you have misunderstood the bug, actually. It has nothing to do with read(2) returning less data than requested. There are two length fields at play here, the SSL record layer length field, and a second length field in the heartbea
651.
by moyix 13y ago
It probably just backdoors any executable it sees on the fly.
652.
by moyix 13y ago
There's a pretty good essay from Scott Aaronson [1] that tries to disentangle the question of randomness from unpredictability, by saying that unpredictable events (which he says are the only things we know of physically that might p
653.
by moyix 13y ago
The lack of reverse debugging isn't an inherent limitation. One could index the replay and take micro-checkpoints along the way; then when you want to step backward, you rewind to the last checkpoint and play forward until you hit the
654.
by moyix 13y ago
This looks very cool, and will undoubtedly help with most run of the mill crashes. Unfortunately the machine model it uses is single-core, so you're not going to necessarily catch the really subtle concurrency bugs. Good multicore reco
655.
by moyix 13y ago
One approach to this is taken by RevGen [1], which uses QEMU to disassemble the target code and lift it to QEMU's intermediate representation (TCG). The TCG ops are then translated to LLVM. It's definitely not perfect, but I suspe
656.
by moyix 13y ago
You might also enjoy Greg Egan, particularly something like Diaspora. Or if you're in the mood for short stories, the collection "Axiomatic" is chock-full of fantastic ideas. Edit: Just noticed Axiomatic is available in Kindl
657.
by moyix 13y ago
> Armoring a system that will accept only signed updates isn't that hard Is that true on extremely resource-constrained devices, e.g. the SD cards being discussed?
658.
by moyix 13y ago
This reminds me of the self-defeating property of an "uninteresting" number -- a reasonable definition might be "any number that does not have any property of human interest", but then of course there is a smallest such
659.
by moyix 13y ago
Sure. Chaitin's Omega is a good example. The question is whether such numbers occur in the real world.
660.
by moyix 13y ago
One possible replacement is the computable numbers [1]; this includes the algebraic numbers and some common transcendentals (e, pi), and you can even build up something akin to standard analysis (computable analysis [2]). [1] http:/&#

More ›