def rsa_crt_dmq1(private_exponent, q):
    return private_exponent % (q - 1)


# Controls the number of iterations rsa_recover_prime_factors will perform
# to obtain the prime factors. Each iteration increments by 2 so the actual
# maximum attempts is half this number.
Apply montage to data.
dataset/ETHPy150Open cloudera/hue/desktop/core/ext-py/cryptography-1.3.1/src/cryptography/hazmat/primitives/asymmetric/rsa.py/rsa_crt_dmq1--crossover with--dataset/ETHPy150Open mne-tools/mne-python/mne/channels/montage.py/_set_montage