Cryptography New PC with W10 and turns out Truecrypt cannot do full disk encryption with pre boot password. Can Veracrypt? |
- New PC with W10 and turns out Truecrypt cannot do full disk encryption with pre boot password. Can Veracrypt?
- About Supersingular Isogeny based crypto [Understanding De Feo's Mathematics of Isogeny Based Cryptography]
- Shannon's perfect secrecy is independent of computing power
- ��UPASH - Node.js Unified API for Password Hashing Algorithms
| Posted: 31 Jul 2018 08:35 PM PDT I installed it and it gives me the option to encrypt windows system partition but makes no mention of pre boot password while the 2nd option (that it wont let me select) is for whole drive encryption and mention pre boot password. So whats the deal with Veracrypt and W10? Been looking for a TC alternative because of the GPT partition and VC seemed like the best option. EDIT C drive is an SSD and my 2nd drive is 1tb HDD I will also be encrypting. [link] [comments]  |
| Posted: 31 Jul 2018 08:19 AM PDT The context is: Let Alice and Bob take random walks in two distinct isogeny graphs on the same vertex set. The vertex set is going to consist of the supersingular j-invariants defined over Fp2 , Alice's graph is going to be made of lA-isogenies, while Bob is going to use lB-isogenies. At some point, the paper states: "A walk of length eA in the lA-isogeny graph corresponds to a kernel of size eAlA ; and this kernel is cyclic if and only if the walk does not backtrack. Hence, Alice choosing a secret walk of length eA is equivalent to her choosing a secret cyclic subgroup <A> ⊂ E[ lA ^ eA ]." My question is, why we have that equivalence? If we are considering the graph of lA-isogenies between j-invariants, taking a walk means walking through the j-invariants, ending in new j-invariant. On the other hand E[lA ^ eA] is the kernel of [lAeA] which is a multiplication endomorphism of E. I don't see how taking a subgroup of E[lA ^ eA] is equivalent to take a walk of lenght lA ^ eA in the lA-isogeny graph. [link] [comments]  |
| Shannon's perfect secrecy is independent of computing power Posted: 31 Jul 2018 10:42 AM PDT How can I prove the fact that shannon's perfect secrecy and computing power have no relation? [link] [comments]  |
| ��UPASH - Node.js Unified API for Password Hashing Algorithms Posted: 31 Jul 2018 10:55 AM PDT |
| You are subscribed to email updates from Cryptography news and discussions. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States | |
No comments:
Post a Comment