Two Number-guessing Problems Plus Applications in Cryptography

Xingbo Wang

《International Journal of Network Security》 21卷3期 (2019/05) Pp. 494-500

https://doi.org/10.6633/IJNS.201905_21(3).16

摘要

The article first puts forward two number-guessing problems that is to guess if an odd integer or one of its divisors is a divisor of another odd integer that is contained in an given odd sequence consisting in consecutive odd integers, then solves the two problems through an investigation on the global intrinsic properties of the odd sequence. Several criteria are proved to determine if a special term is contained in an odd sequence. Based on the proved criteria, algorithms are designed to detect if a interval contains a divisor-host that has a common divisor with a given number and to find out the divisor-host by means of probabilistic search. The theory and the algorithms are helpful in cracking a password or some encryption codes.

關鍵字

Cryptography ； Number Guessing ； Password Cracking ； Probabilistic Algorithm