arXiv subjects

Givon Zirkind

Publications and source records attributed to Givon Zirkind.

6 recordsLinked to original sources

arXiv2024

Using Steganography and Watermarking For Medical Image Integrity

Medical imaging has kept up with the digital age. Medical images such as x-rays are no longer keep on film or; even made with film. Rather, they are digital. In addition, they are transmitted for reasons of consultation and telehealth as well as archived. Transmission and retrieval of these images presents an integrity issue, with a high level of integrity being needed. Very small artifacts in a digital medical image can have significant importance, making or changing a diagnosis. It is imperative that the integrity of a medical image, especially in a Region of Interest be identifiable and preserved. Watermarking and steganography are used for the purposes of authenticating images, especially for copyright purposes. These techniques can be applied to medical images. However, these techniques can interfere with the integrity of the picture. While such distortion may be acceptable in other domains, in the medical domain this distortion is not acceptable. High accuracy is imperative for diagnosis. This paper discusses the techniques used, their advantages and shortcomings as well as methods of overcoming obstacles to integrity.

cs.CR↗

arXiv2016

Beyond Binary Computers: How To Implement Multi-Switch Computer Hardware and Software and; The Advantage of a Multi-Switched Computer

This paper explores the possibilities of using a computing methodology --hardware and software-- that employs technology other than binary. I refer to this as "supra - binary" computing. Software constructs that use more than binary techniques are discussed. The gains in supra - binary software are demonstrated, which includes supra - binary code being RISC. Possible hardware implementations of a computer with other than binary based architecture are demonstrated and considered. The advantages and possible disadvantages of these hardware implementations are discussed. The gain in computing speed is evaluated and demonstrated. Supra - binary processing would streamline parallel processing and make its implementation a built - in feature of the software and hardware. Also, supra - binary would bring an advancement to neural networking. This is discussed and demonstrated. In addition, possible applications of supra - binary computing to database and neural networking are discussed. Also, the possible implementations could be applied to telecommunications with dramatic results.

cs.OH↗

arXiv2013

One Time Pad Password Protection: Using T.E.C. Steganography and Secure Password Transmission Protocols

A while ago, I developed what I called an encryption method. The most favorable of reviews did not see a method but a collection of techniques. Be that as it may, the process used, is described in the paper, Windtalking Computers. This paper is about the steganographic method described, the cryptanalysis efforts of that method and; a real world application of that method as an answer to the increasing problem of password file hacking. The premise is that the technique is a variant of one time pad, using a novel way to produce one time pad output for digital input. There is no record in the literature of such a method being used for encryption at all. Digital encryption generally treats the letters of the plaintext as a binary number and does some mathematical computation to produce ciphertext. The idea of inserting bits with a random generated key is new. Therefore (because a uniquely random generated key is used), the encryption is cryptanalytically unbreakable and/or computationally secure and/or information theoretic. An academic version was made. Challenges for decryption have not produced to-date a decryption. Advantages and disadvantages of the method are discussed. Hackers are constantly penetrating networks and stealing password files. Which, once in possession of a password file, hackers individually or collectively with distributed processing over the Internet, decrypt the values of the hash passwords. Thereby gaining access to systems. This problem has become sufficiently significant for CAESAR (Competition for Authenticated Encryption: Security, Applicability, and Robustness) to make calls for papers for solutions. Herein is one proposed solution. While one time pad presents a problem being computationally intensive, for the relatively short length of passwords, the cost of computation may be cost effective for the security provided.

cs.CR↗

arXiv2012

Windtalking Computers: Frequency Normalization, Binary Coding Systems and Encryption

This paper discusses the application of known techniques, knowledge and technology in a novel way for encryption. Two distinct and separate methods are presented. Method 1: Alter the symbol set of the language by adding additional redundant symbols for frequent symbols. This will reduce the high frequency of more commonly used symbols. Hence, frequency analysis upon ciphertext will not be possible. Hence, decryption will be possible. Method 2: Computers use binary base 2. Most encryption systems use ciphering to convert data to ciphertext. The author presents the theory and several possible implementations of a method for computers analogous to speaking another language. This is done by using a binary base other than base 2. Ex. Fibonacci, Phi or Prime. In addition, steganography may be used for creating alternate binary bases. This kind of encryption significantly increases the complexity of decryption. First the binary base must be known. Only then, can decryption begin. This kind of encryption also breaks the transitivity of plaintext-codebook-binary; the correlation of letters-ASCII-base2. With this transitivity broken, decryption is logically impossible. Coupled with encrypting the plaintext, binary encryption makes decryption uncrackable. It may produce false positives--information theoretic secure, and requires much more computing power to resolve than is currently used in brute force decryption. Hence, the assertion that these combination of methods are computationally secure--impervious to brute force. The proposed system has a drawback. It is not as compressed as a base2. (Similar to adding random padding to the encryption.) However, this is acceptable, since the goal is very strong encryption: Both methods are not decryptable by method uncrackable - by conventional, statistical means.

cs.CR↗

arXiv2010

Using Repeating Decimals As An Alternative To Prime Numbers In Encryption

This article is meant to provide an additional point of view, applying known knowledge, to supply keys that have a series of non-repeating digits, in a manner that is not usually thought of. Traditionally, prime numbers are used in encryption as keys that have non-repeating sequences. Non-repetition of digits in a key is very sought after in encryption. Uniqueness in a digit sequence defeats decryption by method. In searching for methods of non-decryptable encryption as well as ways to provide unique sequences, other than using prime numbers, the idea of using repeating decimals came to me. Applied correctly, a repeating decimal series of sufficient length will stand in as well for a prime number. This is so, because only numbers prime to each other will produce repeating decimals and; within the repeating sequence there is uniqueness of digit sequence.

cs.CR↗

arXiv2010

Using Repeating Decimals As An Alternative To Prime Numbers In Encryption

This article is meant to provide an additional point of view, applying known knowledge, to supply keys that have a series of non-repeating digits, in a manner that is not usually thought of. Traditionally, prime numbers are used in encryption as keys that have non-repeating sequences. Usually, non-repetition, especially of digits in a key, is very sought after in encryption. Uniqueness in a digit sequence defeats decryption. In searching for methods of non-decryptable encryption as well as ways to provide unique sequences, other than using prime numbers [5], the idea of using repeating decimals came to me. Applied correctly, a repeating decimal series of sufficient length will stand in as well for a prime number. This is so, because only numbers prime to each other will produce repeating decimals and; within the repeating sequence there is uniqueness of digit sequence.

cs.CR↗