question: modular random number generator . generate an equally distributed random number less than mod with a bitlength at most 4 less than the bit length of mod . concode_field_sep PlaceHolder placeHolder concode_field_sep boolean coprime concode_elem_sep int byte_size concode_elem_sep void print_array concode_elem_sep void copy_into_byte_array concode_elem_sep String to_byte_hex_string concode_elem_sep BigInteger from_byte_array concode_elem_sep BigInteger mod_rand_with_inverse concode_elem_sep BigInteger multi_exponent
target: BigInteger function ( Random arg0 , BigInteger arg1 ) { int loc0 = arg1 . bitLength ( ) ; BigInteger loc1 ; do { loc1 = new BigInteger ( loc0 , arg0 ) ; } while ( loc1 . bitLength ( ) < loc0 - 4 || loc1 . compareTo ( arg1 ) >= 0 ) ; return loc1 ; }