(e, t)
| 980 | } |
| 981 | |
| 982 | function NtEJ(e, t) { |
| 983 | if (t < e["length"] + 11) { |
| 984 | console && console["error"] && console["error"]("Message too long for RSA"); |
| 985 | return null; |
| 986 | } |
| 987 | var r = []; |
| 988 | var n = e["length"] - 1; |
| 989 | while (n >= 0 && t > 0) { |
| 990 | var i = e["charCodeAt"](n--); |
| 991 | if (i < 128) { |
| 992 | r[--t] = i; |
| 993 | } else if (i > 127 && i < 2048) { |
| 994 | r[--t] = i & 63 | 128; |
| 995 | r[--t] = i >> 6 | 192; |
| 996 | } else { |
| 997 | r[--t] = i & 63 | 128; |
| 998 | r[--t] = i >> 6 & 63 | 128; |
| 999 | r[--t] = i >> 12 | 224; |
| 1000 | } |
| 1001 | } |
| 1002 | r[--t] = 0; |
| 1003 | var o = new ThbW(); |
| 1004 | var a = []; |
| 1005 | while (t > 2) { |
| 1006 | a[0] = 0; |
| 1007 | while (a[0] == 0) |
| 1008 | o["nextBytes"](a); |
| 1009 | r[--t] = a[0]; |
| 1010 | } |
| 1011 | r[--t] = 2; |
| 1012 | r[--t] = 0; |
| 1013 | return new UoGV(r); |
| 1014 | } |
| 1015 | |
| 1016 | function ONBD() { |
| 1017 | this["n"] = null; |