Modern enterprise data—tracking key performance indicators like conversions or click-throughs—exhibits a pathologically high dimensionality, which requires re-thinking data representation to make analysis tractable.
Symmetric Key Generation Algorithm in Linear Block Cipher Over LU Decompositi...ijtsrd
In symmetric key algorithm in linear block cipher to encrypt and decrypt the messages using matrix and inverse matrix. In this proposed technique generate lower and upper triangular matrices from the square matrix using decomposition. In encryption process, the key is a lower triangular matrix and decryption process, the key is upper triangular matrix under modulation of the prime number. We illustrate the proposed technique with help of examples. P.Sundarayya | M.G.Vara Prasad"Symmetric Key Generation Algorithm in Linear Block Cipher Over LU Decomposition Method " Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-4 , June 2017, URL: http://www.ijtsrd.com/papers/ijtsrd90.pdf http://www.ijtsrd.com/computer-science/computer-security/90/symmetric-key-generation-algorithm-in--linear-block-cipher-over-lu-decomposition-method--/psundarayya-
Novel Methods of Generating Self-Invertible Matrix for Hill Cipher Algorithm.CSCJournals
In this paper, methods of generating self-invertible matrix for Hill Cipher algorithm have been proposed. The inverse of the matrix used for encrypting the plaintext does not always exist. So, if the matrix is not invertible, the encrypted text cannot be decrypted. In the self-invertible matrix generation method, the matrix used for the encryption is itself self-invertible. So, at the time of decryption, we need not to find inverse of the matrix. Moreover, this method eliminates the computational complexity involved in finding inverse of the matrix while decryption.
Modern enterprise data—tracking key performance indicators like conversions or click-throughs—exhibits a pathologically high dimensionality, which requires re-thinking data representation to make analysis tractable.
Symmetric Key Generation Algorithm in Linear Block Cipher Over LU Decompositi...ijtsrd
In symmetric key algorithm in linear block cipher to encrypt and decrypt the messages using matrix and inverse matrix. In this proposed technique generate lower and upper triangular matrices from the square matrix using decomposition. In encryption process, the key is a lower triangular matrix and decryption process, the key is upper triangular matrix under modulation of the prime number. We illustrate the proposed technique with help of examples. P.Sundarayya | M.G.Vara Prasad"Symmetric Key Generation Algorithm in Linear Block Cipher Over LU Decomposition Method " Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-4 , June 2017, URL: http://www.ijtsrd.com/papers/ijtsrd90.pdf http://www.ijtsrd.com/computer-science/computer-security/90/symmetric-key-generation-algorithm-in--linear-block-cipher-over-lu-decomposition-method--/psundarayya-
Novel Methods of Generating Self-Invertible Matrix for Hill Cipher Algorithm.CSCJournals
In this paper, methods of generating self-invertible matrix for Hill Cipher algorithm have been proposed. The inverse of the matrix used for encrypting the plaintext does not always exist. So, if the matrix is not invertible, the encrypted text cannot be decrypted. In the self-invertible matrix generation method, the matrix used for the encryption is itself self-invertible. So, at the time of decryption, we need not to find inverse of the matrix. Moreover, this method eliminates the computational complexity involved in finding inverse of the matrix while decryption.
Deep Learning: Recurrent Neural Network (Chapter 10) Larry Guo
This Material is an in_depth study report of Recurrent Neural Network (RNN)
Material mainly from Deep Learning Book Bible, http://www.deeplearningbook.org/
Topics: Briefing, Theory Proof, Variation, Gated RNNN Intuition. Real World Application
Application (CNN+RNN on SVHN)
Also a video (In Chinese)
https://www.youtube.com/watch?v=p6xzPqRd46w
Fractal Dimension of Space-time Diagrams and the Runtime Complexity of Small ...Hector Zenil
Complexity measures are designed to capture complex behaviour and to quantify how complex that particular behaviour is. If a certain phenomenon is genuinely complex this means that it does not all of a sudden becomes simple by just translating the phenomenon to a different setting or framework with a different complexity value. It is in this sense that we expect different complexity measures from possibly entirely different fields to be related to each other. This work presents our work on a beautiful connection between the fractal dimension of space-time diagrams of Turing machines and their time complexity. Presented at Machines, Computations and Universality (MCU) 2013, Zurich, Switzerland.
This paper reviews algorithmic information theory, which is an attempt to apply information-theoretic and probabilistic
ideas to recursive function theory. Typical concerns in this approach are, for example, the number of bits of information required to
specify an algorithm, or the probability that a program whose bits are chosen by coin flipping produces a given output. During the past
few years the definitions of algorithmic information theory have been reformulated. The basic features of the new formalism are presented
here and certain results of R. M. Solovay are reported.
Fractal dimension versus Computational ComplexityHector Zenil
We investigate connections and tradeoffs between two important complexity measures: fractal dimension and computational (time) complexity. We report exciting results applied to space-time diagrams of small Turing machines with precise mathematical relations and formal conjectures connecting these measures. The preprint of the paper is available at: http://arxiv.org/abs/1309.1779
Image encryption technique incorporating wavelet transform and hash integrityeSAT Journals
Abstract
This paper is basically designed for image encryption using wavelet Transform Techniques and its integrity incorporating hash value with SHA-256. Techniques which is involved in encryption is image confusion, image diffusion, wavelet Transform, Inverse wavelet Transform and finally hash value computation of original image. Techniques which are involved for Decryption is reverse of Encryption.
Keywords: wavelet Transform, Hash value, Encryption, Decryption.
Discusses the concept of Language Models in Natural Language Processing. The n-gram models, markov chains are discussed. Smoothing techniques such as add-1 smoothing, interpolation and discounting methods are addressed.
Penalty Function Method For Solving Fuzzy Nonlinear Programming Problempaperpublications3
Abstract: In this work, the fuzzy nonlinear programming problem (FNLPP) has been developed and their result have also discussed. The numerical solutions of crisp problems and have been compared and the fuzzy solution and its effectiveness have also been presented and discussed. The penalty function method has been developed and mixed with Nelder and Mend’s algorithm of direct optimization problem solutionhave been used together to solve this FNLPP.
Keyword:Fuzzy set theory, fuzzy numbers, decision making, nonlinear programming, Nelder and Mend’s algorithm, penalty function method.
Deep Learning: Recurrent Neural Network (Chapter 10) Larry Guo
This Material is an in_depth study report of Recurrent Neural Network (RNN)
Material mainly from Deep Learning Book Bible, http://www.deeplearningbook.org/
Topics: Briefing, Theory Proof, Variation, Gated RNNN Intuition. Real World Application
Application (CNN+RNN on SVHN)
Also a video (In Chinese)
https://www.youtube.com/watch?v=p6xzPqRd46w
Fractal Dimension of Space-time Diagrams and the Runtime Complexity of Small ...Hector Zenil
Complexity measures are designed to capture complex behaviour and to quantify how complex that particular behaviour is. If a certain phenomenon is genuinely complex this means that it does not all of a sudden becomes simple by just translating the phenomenon to a different setting or framework with a different complexity value. It is in this sense that we expect different complexity measures from possibly entirely different fields to be related to each other. This work presents our work on a beautiful connection between the fractal dimension of space-time diagrams of Turing machines and their time complexity. Presented at Machines, Computations and Universality (MCU) 2013, Zurich, Switzerland.
This paper reviews algorithmic information theory, which is an attempt to apply information-theoretic and probabilistic
ideas to recursive function theory. Typical concerns in this approach are, for example, the number of bits of information required to
specify an algorithm, or the probability that a program whose bits are chosen by coin flipping produces a given output. During the past
few years the definitions of algorithmic information theory have been reformulated. The basic features of the new formalism are presented
here and certain results of R. M. Solovay are reported.
Fractal dimension versus Computational ComplexityHector Zenil
We investigate connections and tradeoffs between two important complexity measures: fractal dimension and computational (time) complexity. We report exciting results applied to space-time diagrams of small Turing machines with precise mathematical relations and formal conjectures connecting these measures. The preprint of the paper is available at: http://arxiv.org/abs/1309.1779
Image encryption technique incorporating wavelet transform and hash integrityeSAT Journals
Abstract
This paper is basically designed for image encryption using wavelet Transform Techniques and its integrity incorporating hash value with SHA-256. Techniques which is involved in encryption is image confusion, image diffusion, wavelet Transform, Inverse wavelet Transform and finally hash value computation of original image. Techniques which are involved for Decryption is reverse of Encryption.
Keywords: wavelet Transform, Hash value, Encryption, Decryption.
Discusses the concept of Language Models in Natural Language Processing. The n-gram models, markov chains are discussed. Smoothing techniques such as add-1 smoothing, interpolation and discounting methods are addressed.
Penalty Function Method For Solving Fuzzy Nonlinear Programming Problempaperpublications3
Abstract: In this work, the fuzzy nonlinear programming problem (FNLPP) has been developed and their result have also discussed. The numerical solutions of crisp problems and have been compared and the fuzzy solution and its effectiveness have also been presented and discussed. The penalty function method has been developed and mixed with Nelder and Mend’s algorithm of direct optimization problem solutionhave been used together to solve this FNLPP.
Keyword:Fuzzy set theory, fuzzy numbers, decision making, nonlinear programming, Nelder and Mend’s algorithm, penalty function method.
Building graphs to discover information by David Martínez at Big Data Spain 2015Big Data Spain
The basic challenge of a data scientist is to unveil information from raw data. Traditional machine learning algorithms have treated “pure” data analytics situations that should comply with a set of restrictions, such as access to labels, a clear prediction objective… However, the reality in practice shows that, due to the wide spread of data science nowadays, the exception is the norm and it is usual to encounter situations that depend on gathering information from raw data which lacks any kind of structure, or objective that classic approaches assume. In these situations, building a graph that encodes the information we are trying to unveil is the most intuitive place to start or even the only one feasible when we lack any field knowledge or previously stated aim. Unfortunately, building a graph when the number of nodes is huge from scratch is a challenging task computationally, and requires some approximations to make it feasible. In this review, we will talk about the most standard way of building those graphs in practice, and how to exploit them to solve data science tasks.
Session presented at Big Data Spain 2015 Conference
15th Oct 2015
Kinépolis Madrid
http://www.bigdataspain.org
Event promoted by: http://www.paradigmatecnologico.com
Abstract: http://www.bigdataspain.org/program/thu/slot-11.html#spch11.2
Pairwise Keys Generation Using Prime Number Function in Wireless Sensor NetworksIDES Editor
Providing security in wireless sensor networks is
a very crucial task. Because of its dynamic nature (no fixed
topology) and resource constraint devices. Which has limited
computational abilities, memory storage and physical
restrictions. Advancement in the field of intrusion and
evaesdroping has increased challenges for a secure
communication between nodes. So, establishments of pair wise
keys in a wireless network becomes a vital issue. Hence,
securely distributing keys among sensor nodes is a
fundamental challenge for providing seamless transmission
and security services. Having little resources in our hand,
it is always a tough task to design and implement protocols.
But this paper proposes a new robust key pre-distribution
scheme which resolves this issue without compromising
security. This paper presents a new mechanism to achieve
pair wise keys between two sensor nodes by using the
algebraic, exponential, logarithm functions and prime
numbers. The resilience method under this scheme is based
on discontinuous functions which is hard to be spoofed.
Stegnography of high embedding efficiency by using an extended matrix encodin...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Stegnography of high embedding efficiency by using an extended matrix encodin...eSAT Journals
Abstract F5 Steganography is way totally different from most of LSB replacement or matching steganographic schemes, as a result of matrix encryption is used to extend embedding potency while reducing the amount of necessary changes. By victimisation this theme, the hidden message inserted into carrier media observably is transferred via a safer imperceptible channel. The embedding domain is that the quantitative DCT coefficients of JPEG image, which makes the theme, be proof against visual attack and statistical attack from the steganalyst. Based on this effective theme, An extended matrix encoding algorithm is planned to improve the performance further in this paper. The embedding potency and embedding rate get accrued to large extent by changing the hash function in matrix encryption and changing the coding mode. Eventually, the experimental results demonstrate the extended algorithm is more advanced and efficient to the classic F5 Steganography.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Internet of Things (IoT) two-factor authentication using blockchainDavid Wood
Presented at the Ethereum Engineering Group Meetup in Brisbane, Australia, on 13 Nov 2019. We report on research to use an Ethereum blockchain as an MFA and/or MPA device to secure command channels on IoT networks, even when the underlying network may be compromised.
Methods for Securing Spacecraft Tasking and Control via an Enterprise Ethereu...David Wood
Presentation at ICSSC 2019 (see http://www.kaconf.org) associated with the following academic paper:
David Hyland-Wood, Peter Robinson, Roberto Saltini, Sandra Johnson, Christopher Hare. Method for Securing Spacecraft Tasking and Control via an Enterprise Ethereum Blockchain. Proc. 37th International Communications Satellite Systems Conference (ICSSC), 29 October - 1 November 2019.
Implementing the Verifiable Claims data modelDavid Wood
The W3C Verifiable Claims data model arguably requires a decentralised, distributed database controllable by three types of parties; issuers, inspectors, and holders. This presentation explores the benefits of implementing the Verifiable Claims data model using the RDF and Linked Data technology stack.
Metaphors define civilized life. They are all around us in the stories that we teach our children and tell each other to justify our actions. But social metaphors have a dark side. They can cause entire civilizations to self destruct. Metaphors can kill. This presentation explores the power, and danger, of metaphors as social memes.
These slides are from a talk given to the Fredericksburg Secular Humanists (FSH) in Fredericksburg, Virginia, on 8 November 2015. FSH is sub-chapter of the United Coalition of Reason (unitedcor.org). The talk compared the secular societies of the United States and Australia.
Building a writer's platform with social mediaDavid Wood
This presentation reports on my progress in trying to build my writer's platform using social media. It focuses on Twitter, but the advice is generally applicable. Kudos to my mentors @DanCitizen and @RayneHall.
A summary of the Hero's Journey, Joseph Campbell's formulation of the "monomyth" in mythology and literature. Originally presented to the Fredericksburg Writing as a Business Meetup, 24 January 2015.
Open Data is the idea that "certain data should be freely available to everyone to use and republish as they wish, without restrictions from copyright, patents or other mechanisms of control”. Open Data follows similar “open” concepts that have proven to be valuable in the information economy such as Open Standards, Open Source Software, Open Content and has been followed more recently by variations on the theme such as Open Science and Open Government.
Open Data allows information of common value to be reused without needing to be recreated. The economic benefits of Open Data include cost reduction, organizational efficiencies and the facilitation of commonly held understanding. The costs of implementing Open Data deployment strategies tend to be iterative on top of existing information infrastructure.
This presentation will describe Open Data and its place in the ecosystem of economic and governmental discourse.
2. The Mighty Mod Function
● We define the modulo n function as follows:
If x = qn + r, 0 ≤ r ≤ n, then x mod n = r.
● In other words, x mod n is the nonnegative remainder
(also called the residue of x modulo n) when x is
divided by the positive integer n.
Section 4.5 The Mighty Mod Function 2
Wednesday, March 24, 2010
3. Hashing
● A hash function h: S → T, where the domain S is a set
of text strings or integer values and the codomain T is
the set of integers {0, 1, … , t − 1}, where t is some
relatively small positive integer.
● If the domain S consists of text strings, we can
imagine them encoded in some way into integer
values.
● For example, an algorithm as simple as converting
each individual letter of a text string into its position
in the alphabet and adding up the resulting list.
● The function h therefore maps a potentially large set
of values S into a relatively small window of integer
values T. Consequently h isn’t likely to be a one-to-
one function.
Section 4.5 The Mighty Mod Function 3
Wednesday, March 24, 2010
4. Hashing
● A hash function is often used as part of a search algorithm.
● In a search using a hash function, n elements are stored in an
array (a one-dimensional table) called a hash table, where the
array is indexed from 0 through t − 1; the table is of size t.
● The element x is passed as the argument to the hash function,
and the resulting h(x) value gives the array index at which the
element is then stored.
● Later, when a search is carried out, the target value is run
through the same hash function, giving an index location in the
hash table, which is where to look for the matching stored
element.
Section 4.5 The Mighty Mod Function 4
Wednesday, March 24, 2010
5. Hashing
● However, because the hash function is not one-to-one,
things are not quite that simple.
● Different values may hash to the same array index,
producing a collision.
● Here are several collision resolution algorithms
available. One is called linear probing.
■
Keep going in the array and store element x in the next
available empty slot.
● Another method, called chaining, builds a linked list
for each array index.
Section 4.5 The Mighty Mod Function 5
Wednesday, March 24, 2010
6. Hashing
● The following are the desirable properties of a hash
function:
1. Given an argument value x, h(x) can be computed
quickly.
2. The number of collisions will be reduced because h(x)
does a good job of distributing values throughout the
hash table.
● Use of a modulo function as the hash function
accomplishes goal 1.
● Goal 2 is harder to achieve, but distribution seems to
work better on the average if the table size (the
modulo value) is a prime number.
Section 4.5 The Mighty Mod Function 6
Wednesday, March 24, 2010
7. Hashing
● The average number of comparisons required to
search for an element using hashing depends on the
ratio of n to the total table size t.
● If this ratio is low, then (using linear probing) there
are lots of empty slots, so you won’t have to look very
far to find a place to insert a new element into the
table.
● If this ratio is low and chaining is used, the average
length of any linked list you may have to
(sequentially) search for a target element should be
short.
● This ratio n/t is called the load factor of the hash
table.
Section 4.5 The Mighty Mod Function 7
Wednesday, March 24, 2010
8. Computer Security
● The mod function plays a part in many aspects of
security.
● Military information, financial information, and
company proprietary information that must be
transmitted securely uses some encoding/decoding
scheme.
● The original information (called the plaintext) is
encrypted using an encryption key, resulting in coded
text called the ciphertext.
● The ciphertext is transmitted, and when it is received,
it can be decoded using the corresponding decryption
key. Encryption and decryption are inverse functions
in the sense that:
■
decryption(encryption(plaintext)) = plaintext
Section 4.5 The Mighty Mod Function 8
Wednesday, March 24, 2010
9. Computer Security
● Cryptography is the study of various encryption/
decryption schemes.
● Military use of cryptographic techniques can be traced
back to Julius Caesar, who sent messages to his
generals in the field using a scheme now known as the
Caesar cipher.
● Let us assume that plaintext messages use only the 26
capital letters of the alphabet, that spaces between
words are suppressed, and that each letter is first
mapped to its corresponding position in the alphabet.
Section 4.5 The Mighty Mod Function 9
Wednesday, March 24, 2010
10. Computer Security
● We’ll denote this mapping as the bijection g: {A, … ,
Z} → {0, … , 25}.
● Then a positive integer key value k is chosen that
shifts each number k positions to the right with a
“wrap-around” back to the beginning if needed (this is
the mod function).
● Finally, the function g−1 is applied to translate the
resulting number back into a letter.
● The encoding function is given by:
■
f(p) = g−1([g(p) + k] mod 26)
● The decoding function is:
■ f −1(c) = g−1([g(c) − k] mod 26)
Section 4.5 The Mighty Mod Function 10
Wednesday, March 24, 2010
11. Computer Security
● The Caesar cipher is a simple substitution cipher,
meaning that each plaintext character is coded
consistently into the same single ciphertext character.
● Encryption techniques where a single plaintext
character contributes to several ciphertext characters
introduce diffusion. The advantage to diffusion is that
it hides the frequency statistics of individual letters,
making analysis of an intercepted ciphertext message
much more difficult.
● DES (Data Encryption Standard) is an
internationally standard encryption algorithm
developed in 1976. DES was developed to safeguard
the security of digital information, so we may consider
the plaintext to be a string of bits.
Section 4.5 The Mighty Mod Function 11
Wednesday, March 24, 2010
12. Computer Security
● DES is a block cipher.
● A block of 64 plaintext bits is encoded as a unit using
a 56-bit key.
● This results in a block of 64 ciphertext bits.
● Changing one bit in the plaintext or one bit in the key
changes about half the resulting 64 ciphertext bits, so
DES exhibits high diffusion.
● Because the DES algorithm is well known, the only
“secret” part is the 56-bit key that is used.
Section 4.5 The Mighty Mod Function 12
Wednesday, March 24, 2010
13. Computer Security
● AES (Advanced Encryption Standard) is also a
block encryption scheme, but it uses a key length of
128 bits or more.
● AES also uses a form of the Euclidean algorithm.
● Disadvantage of both DES and AES is that they are
symmetric encryption (also called private key
encryption) schemes. The same key is used to both
encode and decode the message.
● In a private key encryption scheme, both the sender
and receiver must know the key. The problem of
securely transmitting a message turns into the problem
of securely transmitting the key to be used for the
encryption and decryption.
Section 4.5 The Mighty Mod Function 13
Wednesday, March 24, 2010
14. Computer Security
● Asymmetric encryption (public key encryption)
schemes use different keys for encoding and decoding.
● The decryption key cannot be derived in any practical
way from the encryption key, so the encryption key
can be made public.
● Anyone can send a message to the intended receiver in
encrypted form using the receiver’s public key, but
only the intended receiver, who has the decryption key,
can decode it.
● The best-known asymmetric encryption scheme is the
RSA public key encryption algorithm.
Section 4.5 The Mighty Mod Function 14
Wednesday, March 24, 2010
15. Hashing for Password Encryption
● A cryptographic hash function is a form of
encryption that does not require storing an encryption
key.
● A hash function is often used to encrypt passwords.
The ideal cryptographic hash function h has two
characteristics:
■
Given x, it is easy to compute the hashed value h(x).
■
Given a hashed value z, it is difficult to find a value x
for which h(x) = z.
● Because of these characteristics, a hash function is
also called a one-way encryption.
Section 4.5 The Mighty Mod Function 15
Wednesday, March 24, 2010
16. Generating and Decomposing Integers
● The modulo function provides an easy way to generate
integer values within some range 0 through n − 1 for some
positive integer n.
● Take any positive integer m and compute m mod n.
● If you have a function to generate a random (or
pseudorandom) integer m, this process generates a random
(or pseudorandom) integer within the desired range.
● You may also want to cycle through the integers in this
range in a controlled fashion.
● Addition modulo n is defined on the set of integers {0, 1,
2, … , n - 1} by:
x +n y = (x + y) mod n
■
Section 4.5 The Mighty Mod Function 16
Wednesday, March 24, 2010