X @sdZddlmZddlZddlZddlZddlZddlZddlZddl m Z ddl m Z ddl mZddlmZyejZdZWn1ek rddlZejd d ZYnXdd d Zd dddZeedr'ddZn ddZddZddZeedroddddZnddddZdS)z3 Django's standard crypto functions and utilities. )unicode_literalsN)settings)six) force_bytes)rangeTzjA secure pseudo-random number generator is not available on your system. Falling back to Mersenne Twister.FcCsk|dkrtj}nt|}t|}tj||j}tj|dt|dtjS)z Returns the HMAC-SHA1 of 'value', using a key generated from key_salt and a secret (which defaults to settings.SECRET_KEY). A different key_salt should be passed in for every application of HMAC. NmsgZ digestmod)r SECRET_KEYrhashlibsha1digesthmacnew)Zkey_saltvalueZsecretkeyrA/home/ubuntu/projects/ifolica/build/django/django/utils/crypto.py salted_hmacs     r Z>abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789csptsJtjtjdtjtjtjfj dj ndj fddt |DS)z Returns a securely generated random string. The default length of 12 with the a-z, A-Z, 0-9 character set returns a 71-bit value. log_2((26+26+10)^12) =~ 71 bits z%s%s%szutf-8c3s|]}tjVqdS)N)randomchoice).0i) allowed_charsrr Msz$get_random_string..) using_sysrandomrseedr sha256getstatetimerrencoder joinr)lengthrr)rrget_random_string6s   #r#compare_digestcCstjt|t|S)N)r r$r)val1val2rrrconstant_time_compareRsr'cCst|t|krdSd}tjrzt|trzt|trzxht||D]\}}|||AO}qYWn:x7t||D]&\}}|t|t|AO}qW|dkS)a Returns True if the two strings are equal, False otherwise. The time taken is independent of the number of characters that match. For the sake of simplicity, this function executes in constant time only when the two strings have the same length. It short-circuits when they have different lengths. Since Django only uses it to compare hashes of known expected length, this is acceptable. Fr)lenrPY3 isinstancebyteszipord)r%r&resultxyrrrr'Us 'cCsttj|dS)zq Convert a binary string into a long integer This is a clever optimization for fast xor vector math )intbinasciihexlify)r/rrr _bin_to_longlsr5cCstj||jdS)zw Convert a long integer into a binary string. hex_format_string is like "%020x" for padding 10 characters. ascii)r3 unhexlifyr )r/hex_format_stringrrr _long_to_binusr9 pbkdf2_hmaccCs^|dkrtj}n|s'd}nt|}t|}tj|j||||S)z Implements PBKDF2 with the same API as Django's existing implementation, using the stdlib. This is used in Python 2.7.8+ and 3.4+. N)r rrr:name)passwordsalt iterationsdklenr rrrpbkdf2~s     r@c sdkst|s$tj}nt|}t|j}|sW|}n|d|krvtdn| | }||d|}d|d||t|jkr||j}n|djt|7}j |j t j j |j t j fdd fd d td|D}d j||d |S)a Implements PBKDF2 as defined in RFC 2898, section 5.2 HMAC+SHA256 is used as the default pseudo random function. As of 2014, 100,000 iterations was the recommended default which took 100ms on a 2.7Ghz Intel i7 with an optimized implementation. This is probably the bare minimum for security given 1000 iterations was recommended in 2001. This code is very well optimized for CPython and is about five times slower than OpenSSL's implementation. Look in django.contrib.auth.hashers for the present default, it is lower than the recommended 100,000 because of the performance difference between this and an optimized implementation. r z dklen too bigz%%0%ixscstjd|}d}xottD][}jj}}|j||j|j|j}|t|N}q/Wt|S)Ns>Ir) structpackrr2copyupdater r5r9)rur.jZdig1Zdig2)r8innerr>outerr=rrFs  zpbkdf2..Fcsg|]}|qSrr)rr/)rLrr s zpbkdf2..Nll)AssertionErrorr rr digest_size OverflowErrorr( block_sizer rG translater Ztrans_36Ztrans_5Crr!) r<r=r>r?r ZhlenlrTr)rLr8rJr>rKr=rr@s,       ")__doc__ __future__rr3r r rrDrZ django.confrZ django.utilsrZdjango.utils.encodingrZdjango.utils.six.movesr SystemRandomrNotImplementedErrorwarningswarnrr#hasattrr'r5r9r@rrrrs: