On Factoring Jevons' Number

  title={On Factoring Jevons' Number},
  author={Solomon W. Golomb},
  • S. Golomb
  • Published 1 July 1996
  • Mathematics, Computer Science
  • Cryptologia
In the 1870's, W.S. Jevons anticipated a key feature of the RSA algorithm for public key cryptography, namely that multiplication of integers is easy, but finding the prime factors of the product is hard. He presented a specific ten-digit number whose prime factorization, he believed, would forever remain unknown except to himself. In this paper, it is shown that Jevons' number could have been factored relatively easily, even in his own time. 

Cracking RSA with Various Factoring Algorithms

Four factorization algorithms which use elementary number theory to assess the safety of various RSA moduli are analyzed and compared.

On the Connections Between RSA Cryptosystem and the Fibonacci Numbers

A necessary condition for u p to be a Fibonacci prime is that p be a prime number. Another condition for u p ≥ 5 to be a Fibonacci prime is by Theorem 1. of [4] u p = 6k ± 1 (Theorem 1. of [4]). If u

Enumerating Types of Boolean Functions

  • A. Urquhart
  • Mathematics
    The Bulletin of Symbolic Logic
  • 2009
The details of Pólya's solution to the problem of enumerating the types of Boolean functions under the group of variable permutations and complementations, and the history of the problem from the 1870s to the 1970s are explained.

An Archeology of Cryptography: Rewriting Plaintext, Encryption, and Ciphertext

This dissertation offers a critique of the prevailing views of cryptography by tracing a number of long overlooked themes in its history, including the development of artificial languages, machine translation, media, code, notation, silence, and order.

A Complete Bibliography of Publications in Cryptologia

(t,m) [?]. (t, n) [?, ?]. $10.00 [?]. $12.00 [?]. 128 [?]. $139.99 [?]. $15.00 [?]. $16.95 [?]. $16.96 [?]. $18.95 [?]. $24.00 [?]. $24.00/$34 [?]. $24.95 [?, ?]. $26.95 [?]. $29.95 [?]. $30.95 [?].