Reputation
341
Top tag
Next privilege 500 Rep.
Access review queues
Badges
1 9
Newest
 Yearling
Impact
~11k people reached

  • 0 posts edited
  • 0 helpful flags
  • 4 votes cast
Jan
6
answered Privacy-preserving authentication with unique user identification for Web applications
Oct
5
awarded  Yearling
May
8
awarded  Popular Question
Nov
27
answered How can I send emails anonymously?
Oct
25
answered How to suspend a user from my website and prevent them from creating a second account?
Oct
19
comment My company policy states I must put all passwords in a password safe shared with management. Is this secure?
Not to be grim but this policy is showing up in more and more organizations to deal with the fact that you might become suddenly dead
Oct
19
comment Why not RSA-encrypt the entire document?
I did read the posting - it was a bit fuzzy, which is why I offered something with a bit more thought behind those exact issues - there's a lot more to digital signatures than this - for example, refer to NIST standards for Federal Financial Management Service (FMS) which specifically dictates mechanisms for non-repudiation of signing purchase orders and other federal obligations
Oct
19
comment Why not RSA-encrypt the entire document?
I beg to differ - the function of a digital signature is non-repudiation, and it is (so far) considered impossible to consider that a digital signature DID NOT REQUIRE POSSESSION OF THE KEY - hence the constraints I gave above and some of the specific considerations with respect to access to the separated public and private key components for signing, and why signing keys are often separated from encryption keys - as far as issues,I think this e-archivo.uc3m.es/bitstream/10016/11882/1/… is better than your example
Oct
19
answered Why not RSA-encrypt the entire document?
Oct
14
answered What are the security implications of phone based keyless entry systems?
Oct
13
comment Could a computer program be used to automate testing for trapdoors?
True - oddly enough, if you dig deep enough into the theory behind this, the issue with the specific example you give is because equality is not commutative (not that I would recommend that it should be :-) ) And I agree there are plenty of other examples - and old prof of mine used to point out that with respect to boundary conditions, the operant logic of a system was a lower transfinite # than the number of boundary and error conditions
Oct
12
answered Is there a spreadsheet/template for Mapping WebServices Authorization Rules?
Oct
12
answered I stupidly responded to an email from a hacker posing as a friend
Oct
11
comment How does formal verification guarantee secure, error-free code?
You're looking at second order effects - you can verify that a loader provably performs a transform,e.g. the source memory array ends up in the destination - proving that any code it loads does not in fact render the system unsafe is outside of scope - and that's less than 10K lines of >microkernel< taking 200K lines of proof to prove - some things never change :-)
Oct
11
answered How does formal verification guarantee secure, error-free code?
Oct
10
awarded  Critic
Oct
10
comment create a variants of MD5
Lack of collision does not correlate to random - a monotonically increasing sequence will not collide and is certainly not random - changing sin() to cos() is (roughly) an inversion, but the rest of the alg may not feel good if you do this - the seeds you want to fiddle with are not random numbers - just use an existing algorithm or buy a hardware generator
Oct
10
answered How should SSL traffic be treated once it has been terminated?
Oct
7
awarded  Teacher
Oct
7
answered Techniques for Writing Encryption Algorithms (Exclusively For Personal Use)