If you forgot the master password, all files inside the secure folder remain encrypted and inaccessible. Not only does this stop outside parties from hacking their way into your text files, it also protects in the event that your PC is stolen. Encryption is the most reliable way to protect your Notepad text files.
There are many other tools that can be used to encrypt. Tags: notepad with password password protect notepad text file password protect text file windows Just a quick word to say thanks. After trying unsuccessfully to remove some stubborn trojans with various other tools, Exterminate It has done the trick! Nice work! If you find Password. It is imperative that you delete malware-associated files as soon as possible because they can be used - or are already being used - to inflict serious damage on your PC, including:.
You can delete locked files with the RemoveOnReboot utility. You can install the RemoveOnReboot utility from here. Create a free Team What is Teams? Collectives on Stack Overflow. Learn more. Asked 9 years, 1 month ago. Active 9 years, 1 month ago. Viewed 7k times. Improve this question.
What have you tried? Which is your traget programming language? So don't do it. You know there are password safes like keepass which store your passwords in a truly safe manner assuming the one master password that you still have to remember is not too easy to guess? In massive generic and automatic analysis this would probably work in practice, but it's a horrible solution that would break upon manual analysis.
Follow best practice with a good encrypted solution - keepass as mentioned in previous comment is a good choice. Add a comment. Active Oldest Votes. A cryptanalyst would probably just do this by hand; This is a text file. All printable characters. Improve this answer. If you are using something abundant, how are you personally going to extract your password? Peter your method is only secure if your passwords are statistically identical to the background 'noise'.
Why not just use an encrypted file, or one of the many dozens of capable password managers that exist? You appear to be solving a problem, poorly, that has already been solved relatively well. Show 3 more comments. Thomas Pornin Thomas Pornin k 57 57 gold badges silver badges bronze badges.
Thank you so much for your clear explanation. In my second example above I don't give clues. I have in my mind the two sets of delimiters, I can find them without fail. The character distribution in a 10MB file will be somewhat evenly. So if all characters from the set are evenly distributed, will it be "easy" to find my 2 password parts?
How much number crunching will it require to try all possibilities? Also, you will tend to hide those two parts in the 'middle' of the file, not at the edges. People are notoriously bad at doing things really random. It's like drawing a card with a name from a stack to win a prize: the top and bottom names never win ;- — user Given 10mb and that delimiter, here's my frequency analysis: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : !
Jeff thank you for your answer. I don't understand what your calculation means. I'll have to study some on the subject. My delimiter would in real life not be as clear cut as my example showed.
If you would look at my second example maybe it would not be so clear cut? Peter it's a demonstration that if you scroll through my list, you should visually see the flaw. I did see that my specifically chosen delimiters had a 2, but what if my first delimiter would have been the first occurrence of until I reach a and my second part between the last and say Peter No. The point is that it is only possible to have one or a few at most of each of your delimiters because there must be nothing between them other than your password.
The larger the file, the most the delimiters will stand out in a frequency analysis. You could put pairs of delimiters together with nothing in between them until you have 40, delimiters but then frequency analysis of pairs of characters looks obvious.
I use last password, but that's not what I'm after. I am just curious how experts would go about starting to attack the problem. In my example 2 you don't have the delimiters, you don't have the length of the parts, you don't know the part I would add.
So how many possibilities are there? In a 10mb file there are only about 50 trillion possible phrases. Assuming that we start with the shorter length though and work our way up, it is significantly fewer possibilities. Lets say we limit each section to 20 characters, there are then only million or so options.
That's only 40 quadrillion pairs. That's only the same entropy as a 9 digit alpha-numeric password, and that assumes that the distribution within the file is purely random, which would make recovery of the information difficult. Since something needs to key the information, it would likely be far easier than brute.
I just don't understand enough about what you are saying. I need to start studying on the concepts mentioned.
0コメント