Editing Public-key cryptography (section)

=== Anticipation ===
In his 1874 book ''The Principles of Science'', [[William Stanley Jevons]] wrote:<ref name=TPS_1>{{cite book| title=The Principles of Science: A Treatise on Logic and Scientific Method| author=Jevons, W.S.| url=https://archive.org/details/principlesofscie00jevorich/principlesofscie00jevorich/page/n166/mode/1up?view=theater| publisher=[[Macmillan & Co.]]| page=141| date=1874| access-date=18 January 2024}}</ref><blockquote>
Can the reader say what two numbers multiplied together will produce the number [[William Stanley Jevons#Jevons' number|8616460799]]?<ref name=JN_1>{{cite web| title=Jevons' Number| author=Weisstein, E.W.| url=https://mathworld.wolfram.com/JevonsNumber.html| publisher=[[MathWorld]]| date=2024| access-date=18 January 2024}}</ref> I think it unlikely that anyone but myself will ever know.<ref name=TPS_1/></blockquote>
Here he described the relationship of [[one-way function]]s to cryptography, and went on to discuss specifically the [[factorization]] problem used to create a [[trapdoor function]]. In July 1996, mathematician [[Solomon W. Golomb]] said: "Jevons anticipated a key feature of the RSA Algorithm for public key cryptography, although he certainly did not invent the concept of public key cryptography."<ref>{{cite journal |doi=10.1080/0161-119691884933 |year=1996 |last=Golob |first=Solomon W. |journal=Cryptologia |volume=20 |issue=3 |page=243|title=On Factoring Jevons' Number |s2cid=205488749 }}</ref>