Online SHA1 hash Generator

Now I am using sha1 encription for my module in magento, but I want to change the encription to base64. i use this password for a connection in API

<password translate="label comment">                            <label>Api Password</label>                            <frontend_type>password</frontend_type>                            <backend_model>adminhtml/system_config_backend_encrypted</backend_model>                            <sort_order>30</sort_order>                            <show_in_default>0</show_in_default>                            <show_in_website>0</show_in_website>                            <show_in_store>1</show_in_store>                            <comment><![CDATA[Api password provided by eMAG.]]></comment>                            <validate>required-entry</validate>                        </password>

let me know what I need to changed to use this ecription only for this autentification and not for the entire magento.i have also this part of code, maybe will help

'hash' => sha1( http_build_query($postData) . sha1($this->getHelper()->getApiPassword($this->getStoreId()))

Thanks

Can we find A string that has exactly N leading zeros when using SHA-1 hashing?
Assume strings have the same first part like StackOverflow. I want to add characters to this string to find a string that has 5 leading zeros.
For example like below (these are not actual results):

StackOverflowfirqk ==> 000006dde7d6496f3961ac6efc9735c270f2ea23StackOverflow66SA7 ==> 0000038cd7f75a71cb9190ad655a494ccf64eb54

In addition, I want to use all alphabet, both small and capital, and digits (and maybe other characters). The length of additional characters is not a matter but for a challenge, I want to find additional of 15 characters. Is there a way rather than brute force algorithms to do this?

What I Did So Far

Here is my code to generate and check this problem:

import itertoolsimport hashlibalphabet = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789'for i in range(1, 21):    for seq in itertools.product(alphabet, repeat=i):        seq = "".join(seq)        input = 'StackOverflow' + seq        hex_hash = hashlib.sha1(input.encode('utf-8')).hexdigest()        binary_hash = "{0:0160b}".format(int(hex_hash, 16))        index = binary_hash.index('1')        if (index > 20):            print(input + ' ' + hex_hash + ' ==> ' + str(index))

But it is a Brute Force way and this way I have an XY Problem. Besides, if there is no way to do that rather than brute force how can we speed this up? multithreading, using big data approaches?

I am trying to get the Sha1 of a file before it is uploaded to a server. I am getting the hash of a file in chunks using FileReader and passing it to the hashing libraries to get a result. I've narrowed the speed difference to the actual hashing process from the libraries I am using. It takes Chrome 8 seconds to hash and send a 100MB file where-as IE11 takes 2 minutes.

I have tried the following libraries:

• https://github.com/emn178/js-sha1

• https://github.com/srijs/rusha

What can I do to get the Sha1 of very large files, in IE11, in a timely manner?

I am familiar with how Git creates SHA1 hashes for files (blobs), but not how they are created for tag objects. I assume they are, if I create an annotated tag, but what is the recipe? And how might I replicate it outside of Git (e.g., in Perl or Python)?

The SHA1 hashes stored in the tree objects (as returned by git ls-tree) do not match the SHA1 hashes of the file content (as returned by sha1sum)

$ git cat-file blob 4716ca912495c805b94a88ef6dc3fb4aff46bf3c | sha1sumde20247992af0f949ae8df4fa9a37e4a03d7063e  -

How does git compute file hashes? Does it compress the content before computing the hash?