Malcolm Low | Practical AI, Computing & Quantum Research

Singapore-based practical guides, tutorials and experiments in AI, computing, modelling, simulation, optimisation and quantum computing, with research notes and hands-on workflows.

, , ,

Reductions Among Number Theoretic Problems: Comp Review

Yes, number theoretic problems share reductions. Misjudging complexity assumptions undermines crypto security. See the computational reduction analysis →

·

Written by

https://www.sciencedirect.com/science/article/pii/0890540187900307

The 1987 paper of Heather Woll, Reductions among number theoretic problems, Information and Computation 72 (1987) 167-179 looks at the reduction between many problems in number theory, including primality, factorization, order-finding, discrete logarithm.

In particular the paper shows that order-finding deterministically reduces to factorization, and that factorization probabilistically reduces to order-finding (see the trick used by Shor’s algorithm).

Comments

Leave a Reply