|  Next  |  Last
Pages: 1 2 3 4 5 6 7 8 9 10 11
Prime Number Distribution mapped exactly by their running Sum.
Greetings . See the graphic proofs that show how Primes are distributed using the first 1300 million primes sums that are graphed to show the order found. The WEB site for the paper "Primes3d.htm" <A HREF=" http://mister-computer.net/index.htm">WEB Site"</A> -- Regards from RD O'Meara ... 13 Aug 2010 16:52
recover the password from a .PFX file
Is there method to extract/recover the password from a .PFX (personal information exchange) file? When signing file, the SignGUI(a front end for MS Signtool utility), requires to specify password, but it lost. ... 13 Aug 2010 10:18
Arithmetic Coder Probability Model $100
do you already knows Arithmetic Codings algorithm .... if so , has a straight forward modification of Aritmetic coding job for you to complete (prefers in C# source codes)... US$100 by Paypal/ Western Union on delivery This presents a basic arithmetic coding implementation, if you have never implemented an arit... 12 Aug 2010 04:57
Scalable Key Cryptography - Make_Moduli_Program_Mark_0
This program is used to generate the set of N's as moduli for any given messsage length. The program is intended for use when using the printable subset of ASCII <= the elements no's 32 to 126 inclusively. Should adapt easily in C. WITH Ada.Text_IO; WITH Ada.Integer_Text_IO; PROCEDURE Make_Moduli_Program_Mark_... 12 Aug 2010 03:53
New Generation Lossless Data Representations
Warm Greetings : Am pleased now in position Press Release to experienced reputable Forum members ( Atomic bomb was thought a 'Newtoninan' impossibility , didnt stop many trying ... latest Iranian as yet unsucessful attempt, N Korea much luckier , India /Pakistan did it kept confidential .... C# knowledge pref... 13 Aug 2010 00:37
New Random Number Generator for encryption
Lev Dymchenko wrote: On 10 ???, 00:57, amzoti <amz...(a)gmail.com> wrote: Does it pass these? http://www.iro.umontreal.ca/~simardr/testu01/tu01.html Had not tested with this yet, cause this appears to have somehow complicated building on Windows. Then try this one: http://www.webalice.it/crist... 13 Aug 2010 14:41
Scalable Key Cryptography - The Universal Model.
A diagrammatic demonstration of what the algorithm is saying analytically - this piece of descriptive geometry cannot be reproduced here - it is to be seen instead on http://www.scalarcryptography.co.uk under the title "The Universal Model" - adacrypt ... 10 Aug 2010 12:28
I am no expert in this field (or in any field for that matter :) ) but check this out: http://www.scribd.com/doc/35539144/pnp12pt If this paper's claims are true, the problem is solved. I think we're all agreed that this represents a significant breakthrough in the field of complexity theory. ... 9 Aug 2010 15:41
[M-R test] Formula for p(k,t)
In the paper "Further Investigations with the Strong Probable Prime Test" http://www.ams.org/journals/mcom/1996-65-213/S0025-5718-96-00695-3/home.html Ronald J. Burthe gives some formulas for the probability that the Miller-Rabin test fails. On page 379, Burthe writes that probability as: p(k,t) = N1 / (N1+P... 9 Aug 2010 06:50
Let C = E(K,P) denote a block encryption processing. I intend to apply authentication as follows (n=number of blocks): S[0] = IV; for (i=0; i<n; i++) { C[i] = E(K,S[i]^P[i]); S[i] = E(K,S[i]^P[i]^C[i]); } S[n-1] = authentication. Are there any security problems in this? Has this be... 13 Aug 2010 19:04
Announcing a new Chaocipher-related paper: Deciphering Exhibit #1 from John F. Byrne's "Silent Years"
A new paper has been uploaded The Chaocipher Clearing House entitled "Chaocipher Revealed: Decipher Exhibit #1". The paper is an in-depth analysis of Byrne's Exhibit #1, made possible after last month's disclosure of the Chaocipher algorithm. This new paper discusses such topics as: (*) The textual layout of ... 8 Aug 2010 04:47
Scalable Key Cryptography – Part 3:
Design details. In theory at least the maximum message length is restricted only by the maximum positive integer that the computer can store i.e., If ‘X’ is initialised at 1073741790 and the upper bound of N is 2 (X +32) (for ASCII) then the maximum message-length is this upper bound of N i.e. 2 (1073741790 ... 7 Aug 2010 13:39
Scalable Key Cryptography – Part 2:
Model and Theory. This is a piece of niche number theory that enables a set of random keys as the modulus N in a modular arithmetic model to be generated for use as keys in encryption work. That set of moduli satisfies the mandatory requirement in cryptography for one random key-set to be provided in a cipher... 7 Aug 2010 13:39
Scalable Key Cryptography – Part 1:
Introduction. This is a bare bones, highly contrived and studiously configured presentation of cryptography being modelled in modular arithmetic. It is intended for the understanding of the design cryptographer reader who has the mathematical wherewithal to understand the connections within the design model in m... 9 Aug 2010 16:48
Key wrapping
Hello, which is the best way to wrap a symmetric key with another symmetric key along with some keys attributes and apply an integrity check? Suppose K is an AES key I need to wrap, A is some key attributes, W the AES key I want to encrypt everything with and | the concatenation operator. My idea is some... 7 Aug 2010 20:11
Prime Number SUMS model the Riemann Zeta function
The first 1300 million primes are summed and then graphed to show the order found. See the WEB site for the paper <A HREF=" http://mister-computer.net/index.htm">WEB Site"</A> -- Regards from RD O'Meara ... 6 Aug 2010 20:23
 |  Next  |  Last
Pages: 1 2 3 4 5 6 7 8 9 10 11