Factoring Numbers in 0(log n) Arithmetic Steps

In this paper we show that a non-trivial factor of a composite number n can be found by performing arithmetic steps in a number proportional to the number of bits in n, and thus there are extremely short straight-line factoring programs. However, this theoretical result does not imply that natural n...

Бүрэн тодорхойлолт

Номзүйн дэлгэрэнгүй
Үндсэн зохиолч: Shamir, Adi
Хэвлэсэн: 2023
Онлайн хандалт:https://hdl.handle.net/1721.1/148919