(int d)
| 207 | } |
| 208 | |
| 209 | public int mi(int d) { |
| 210 | int q, r1, r2, r, t1, t2, t; |
| 211 | r1 = 26; |
| 212 | r2 = d; |
| 213 | t1 = 0; |
| 214 | t2 = 1; |
| 215 | while (r1 != 1 && r2 != 0) { |
| 216 | q = r1 / r2; |
| 217 | r = r1 % r2; |
| 218 | t = t1 - (t2 * q); |
| 219 | r1 = r2; |
| 220 | r2 = r; |
| 221 | t1 = t2; |
| 222 | t2 = t; |
| 223 | } |
| 224 | return (t1 + t2); |
| 225 | } |
| 226 | |
| 227 | public void matrixtoinvkey(int inv[][], int n) { |
| 228 | String invkey = ""; |