A Community Devoted to the Preservation and Practice of Celestial Navigation and Other Methods of Traditional Wayfinding
From: Tony Oz
Date: 2017 Jul 19, 04:06 -0700
Suddenly it occurred to me that certain CN problems are similar to cryptographical: in one direction the solution is (relatively) easy and straightforward, in the other direction - quite difficult and laborious.
Consider finding a GC distance between the two points of known coordinates - easy, just use one formula. The reversed problem of finding the initial coordinates from a known distance is impossible, just like the cryptography on elliptic curve(s).
(I was thinking about a way to obtain AP coordinates from a set of Ho|GPcoordinates without any plotting - but directly by a formula solving)