Skip to main content

Posts

Showing posts with the label Cryptography

Vigenère cipher

After a long time, I've been doing some coding, well I was teaching.I had to do Vigenère cipher in Java. First of all, What is "Vigenère cipher"? The Vigenère cipher is a method of encrypting alphabetic text by using a series of interwoven Caesar ciphers based on the letters of a keyword. It is a form of polyalphabetic substitution ( Wikipedia )  There are a lot of methods for creating this Encryption method. For those who know how to code with OOP Principles, this code may look like Babies Rusk. 😋 We can code this in two ways. Method 1 We use the Vigenère Matrix to find the Cipher Text. We will create the Matrix through looping and row will be either plaintext and column will be key string. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 import java.util.* ; public class Vigenere { public static void main ( String

Raising cryptography’s standards

Calculating encryption schemes’ theoretical security guarantees eases comparison, improvement. Most modern cryptographic schemes rely on computational complexity for their security. In principle, they can be cracked, but that would take a prohibitively long time, even with enormous computational resources. There is, however, another notion of security — information-theoretic security — which means that even an adversary with unbounded computational power could extract no useful information from an encrypted message. Cryptographic schemes that promise information-theoretical security have been devised, but they’re far too complicated to be practical. In a series of papers presented at the Allerton Conference on Communication, Control, and Computing, researchers at MIT and Maynooth University in Ireland have shown that existing, practical cryptographic schemes come with their own information-theoretic guarantees: Some of the data they encode can’t be extracted, even by a

Arabic Threat Group Attacking Thousands of Victims Globally

Kaspersky Lab security expert Dmitry Bestuzhev presents research on “Desert Falcons” at the Kaspersky Lab Security Analyst Summit on Feb. 17. CANCUN, Mexico  – Kaspersky Lab Security Analyst Summit – Threat actors with Arabic roots are targeting multiple high profile organizations and individuals from Middle Eastern countries, according to a new report from Kaspersky Lab. The attack group, dubbed “Desert Falcons” by the security firm, appears to be the first known Arabic cyber-espionage group to develop and run full-scale cyber-espionage operations, researchers said. Details of the campaign, which has been active for at least two years, were unveiled at Kaspersky Lab's Security Analyst Summit in Cancun, Mexico on Tuesday. According to Kaspersky researchers, the peak of their activity occurred at the beginning of 2015, and so far, the attackers have been able to steal more than one million files from more than 3,000 victims in over 50 countries. Kaspersky Lab began its

Cyber Security Week, 2015

In the same week as the Global Conference on CyberSpace (GCCS2015) and One Conference, a Cyber Security Week (13 till 17 April) will be held at the Campus of The Hague Security Delta, the largest security cluster in Europe. Aim is to show the world the innovative strength of The Netherlands created by the triple helix cooperation within the security cluster. During this week, The Hague Security Delta will be putting on an action-packed programme consisting of workshops, debates, networking events, and many  other side-events.  And, of course, the Cyber Security Week 2015 just wouldn't be complete without an Innovation Room with demonstrations of innovations in cyber security. To create a unique programme for our visitors from around the world, we are looking for participation of  businesses, governments, and knowledge institutions working on Cyber Security.   Cyber Security Week Website A special website will be launched by the end of February. It will provide an overv

Railfence Cipher

The rail fence cipher (also called a zigzag cipher) is a form of transposition cipher. It derives its name from the way in which it is encoded. In the rail fence cipher, the plaintext is written downwards and diagonally on successive "rails" of an imaginary fence, then moving up when we reach the bottom rail. When we reach the top rail, the message is written downwards again until the whole plaintext is written out. The message is then read off in rows. The file is available below railfence.java Feb 11, 2015

Play Fair Cipher (Version 2-with some corrections)

In my last post, I attached a file ( PlayFairCipher.java ) as my Play Fair Cipher Crypto System. But, I found out that it has an error when converting single row or column-wise words (E.g. WORD, PICO). Hence, I re-edited the file and my second version of it. Now it was working as expected. File : PlayFairCipherv2.java Comments are welcome.

Play Fair Cipher

The best-known multiple-letter encryption cipher is the Play fair, which treats diagrams in the plaintext as single units and translates these units into ciphertext diagrams.3 The Playfair algorithm is based on the use of a 5 × 5 matrix of letters constructed using a keyword. This cipher was actually invented by British scientist Sir Charles Wheatstone in 1854, but it bears the name of his friend Baron Playfair of St.Andrews, who championed the cipher at the British foreign office. We had to create our own version of PlayFairCipher. I used Java as my Programming language and created this file  PlayFairCipher.java . My Cipher's Key is "WORD". I used 'I' instead of 'J' and 'X' for inserting within double letters

Doubts in C++ to JAVA conversion

In my Numerical Computing I recently created a C++ program to normalize a number to a certaing number. The program is  Normalization.cpp Then, I converted it to a JAVA program. But, I got an liitle bit of problem when converting it. If anyone know the solution, please help me. The converted ptogram is  RelativeError.java

Caesar Cipher

Let's Look at "The Caesar Cipher." The earliest known, and the simplest, use of a substitution cipher was by Julius Caesar. The Caesar cipher involves replacing each letter of the alphabet with the letter standing a number of places further down the alphabet. I implemented in JAVA with a custom shift number(which a user gives as input) to encrypt and decrypt. And my Key consists of Alpha(Capital and simple, one after other)-numeric. But not for the special characters. I divided it into two files. That CSKey.java (Caesar Cipher Key) and CaesarCipher.java which contains the main method.