Indirect Prime Generation via the Tietken–Castell Algorithm and Large Integer Factorization with Castell-Fact (Part 12)

Abstract

Our essays 1 to 11 describe the applicable Castell-Fact-Algorithm, which factorizes large integers, was ignored and rejected by economy and politics. Innovations concerning data protection and security seem not to be in great demand by neither the NSA, nor by Facebook & Co. In the following essay part 12, we introduce the Tietken-Castell-Prime-Algorithm, which is able to indirectly a) produce prime numbers b) identify prime numbers, c) and which is suitable for the factoring of large numbers (composed of prime numbers) after creating a comprehensive registry of numbers.