THE FOUR MESSAGE (K4) OF KRYPTOS

+ The fourth coded message has yet to be solved. It is the hardest, arguably, because it is the shortest of the four messages, containing only 97 characters, so it is harder to find patterns. Recently, Sanborn revealed a clue to the New York Times:

“The characters that are the 64th through 69th in the final series on the sculpture read NYPVTT. When deciphered, they read BERLIN.”

K4 = “OBKRUOXOGHULBSOLIFBBWFLRVQQPRNGKSSOTWTQSJQSS

EKZZWATJKLUDIAWINFB NYPVTT MZFPKWGDKZXTJCDIGKUHUAUEKCAR”

Though 6 doubled letters (BB QQ SS SS ZZ TT) is slightly above chance for a 97 character text, that’s not hellishly improbable but If NYPVTT = BERLIN, this means … T= I but also T= N

I seriously think this is important. The same letters in sequence, representing different letters.

I suppose that when a digraph appears there is a change in the encryption, some type of asymmetry happens


+ The K4 is divided into the following groups, thus

OBKRUOXOGHULBSOLIFB
-BWFLRVQ
-QPRNGKS
-SOTWTQSJQS
-SEKZ
-ZWATJKLUDIAWINFBNYPVT
-TMZFPKWGDKZXTJCDIGKUHUAUEKCAR

Maybe some kind of function f(x)?

EEC ?


+ The Elliptic curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. An elliptic curve cryptosystem is an asymmetric cryptosystem relying on the hardness of the discrete logarithm problem in elliptic curve groups.

In mathematics, an elliptic curve (EC) is a smooth, projective algebraic curve of genus one, on which there is a specified point O. An elliptic curve is in fact an abelian variety – that is, it has a multiplication defined algebraically, with respect to which it is a (necessarily commutative) group – and O serves as the identity element. Often the curve itself, without O specified, is called an elliptic curve.

Any elliptic curve can be written as a plane algebraic curve defined by an equation of the form:

y^2 = x^3 + ax + b

https://i0.wp.com/m.eet.com/media/1170221/point_addition.png
The
figure show a simply elliptic curve.

If you’re interested in the details, read on:

“A (Relatively Easy To Understand) Primer on Elliptic Curve Cryptography”
http://blog.cloudflare.com/a-relatively-easy-to-understand-primer-on-elliptic-curve-cryptography/

BY THE WAY

I suggest that K4 solution is based in the place of BERLIN:

 “PEOPLE TO CREATE A SAFER  FREER WORLD AND SURELY THERE IS NO BETTER PLACE THAN BERLIN THE MEETING PLACE  OF EAST AND WEST”

Barcelona November 02, 2014.

Bye