• Welcome to Tamil Brahmins forums.

    You are currently viewing our boards as a guest which gives you limited access to view most discussions and access our other features. By joining our Free Brahmin Community you will have access to post topics, communicate privately with other members (PM), respond to polls, upload content and access many other special features. Registration is fast, simple and absolutely free so please, join our community today!

    If you have any problems with the registration process or your account login, please contact contact us.

Encryption Pioneers Win Computing’s Most Prestigious Award

Status
Not open for further replies.

Lalit

Active member
Congrats to Diffie and Hellman are in order!

Encryption Pioneers Win Computing’s Most Prestigious Award

IF YOU’VE PICKED up a newspaper in the last two weeks, you’ve probably read something about digital encryption. It’s at the heart of the debate between the FBI and Apple: Can the government compel the company to break the encryption in one of its phones? That argument makes this year’s A.M. Turing award, often referred to as the Nobel Prize of computing, particularly apt.The two winners announced yesterday, Whitfield Diffie and Martin Hellman, are two of the most important figures in the history of encryption. Together, they wrote a seminal paper called “New Directions in Cryptography” in 1976 that laid the groundwork for public key cryptography, a concept central to how the Internet works. It’s the secure “s” at the end of “http” that allows users to conduct financial transactions with confidence and trust that a person or place online is who or what you think it is.Thanks to Diffie and Hellman’s work, the Internet has become a place of commerce and communication. Innovation online abounds, largely because it’s a safe place to exchange goods and services. “You use the math that’s written in their paper every day when you browse the web,” says security technologist Bruce Schenier. “Sure, there’s been enormous development in the past forty years, but their math is still keeping you safe. And that’s extraordinary.”The idea behind public key cryptography, which is also sometimes called asymmetric encryption, is actually kind of simple, even if the math is hard. Think of a door key as symmetric encryption. Everyone who has the same key will be able to open the locked door. With asymmetrical, public key encryption, however, everyone has two sets of keys, a public key and a private key.When a door is locked by someone using public key encryption, they can install a lock that will only open with a certain person’s private key (which no one else will have a copy of). The public key is used to encrypt, or lock, the data, while the private key is used to unlock it. You can make and give away endless copies of your public key. It’s what will allow secure data to be sent to you that only you can open. And it solves the problem of having to send keys over insecure channels in order to share or unlock information, allowing parties who have never before met to have an extremely secure exchange.“Marty Hellman and Whit Diffie richly deserve this prize. Their main contribution was in recognizing the usefulness of a category of mathematical quirks,” says John Gilmore, co-founder of the Electronic Frontier Foundation. (Disclosure: This author has written for the EFF.) “These quirks were ‘trapdoor functions’ which are easy to compute in one direction, easy to compute in the other direction if you have some partial information, but hard to compute in the other direction if you don’t.”“If you had asked someone before Diffie and Hellman in 1976 if you could do this, they would have said don’t be ridiculous, that’s impossible,” says Schneier. “It was an invention that was formed outside the government and really formed academic cryptography, which is everything that keeps us secure online.”The A.M. Turing Award, which has been given since 1966, is named after Alan Turing, the British mathematician and cryptographer who played a key role in breaking the German ciphers, which was instrumental in the victory of the allied forces in World War II.It’s is not only the most prestigious award in computing, it also comes with a huge cash prize—$1,000,000 huge, in large thanks to a donation from Google. Hellman and Diffie were announced as the winners yesterday at the RSA security conference in San Francisco.Both recipients said they plan to leverage their winnings for political projects. Hellman, who is a long-time anti nuclear weapons activist, wrote in a blog post Tuesday that he plans to use his prize money to continue his advocacy and work on a book with his wife about processes towards world peace and sustainability. Diffie has championed for privacy online for decades, and he said at the RSA conference yesterday that he plans on using his winnings to work on a history of cryptography before many of the seminal figures in the field pass away.Public key encryption is how the commercial Internet works. So if you plan to do any online shopping anytime soon, give a little thanks to Diffie and Hellman. Or take the opportunity right now: After all, they’re one of the reasons why you’re able to read this article.
http://www.wired.com/2016/03/encryption-pioneers-win-computings-prestigious-award/



 
A simple puzzle to illustrate how encryption algorithms work

If people are interested they can provide their solution here.

Let us say A wants to mail an expensive piece of diamond over a special courier service to B.

Let us assume that courier people are inquisitive and will steal the diamond if it is not locked in a box. Let us assume that they will not be able to break the lock because key blanks for such a lock is not available.

Now if A locks the diamonds in a box and sends it, B will not have the key to open the lock to get at the diamond.

A says he cannot mail the key separately because it is kind of unique key and he cannot afford that it be lost in transit.

How can B get the diamond?


===============================

It is much like when you are I try to open our email account. Anything in transit has to be encrypted so that no one can steal content. The receiver has to have a way of decrypting but the receiver does not have the key used to encrypt.. So one can see the parallel to the example above.

While reading this article, it will be nice if anyone is able to provide a solution to the puzzle above as to how B can get the diamond
 
If people are interested they can provide their solution here.

Let us say A wants to mail an expensive piece of diamond over a special courier service to B.

Let us assume that courier people are inquisitive and will steal the diamond if it is not locked in a box. Let us assume that they will not be able to break the lock because key blanks for such a lock is not available.

Now if A locks the diamonds in a box and sends it, B will not have the key to open the lock to get at the diamond.

A says he cannot mail the key separately because it is kind of unique key and he cannot afford that it be lost in transit.

How can B get the diamond?


===============================

It is much like when you are I try to open our email account. Anything in transit has to be encrypted so that no one can steal content. The receiver has to have a way of decrypting but the receiver does not have the key used to encrypt.. So one can see the parallel to the example above.

While reading this article, it will be nice if anyone is able to provide a solution to the puzzle above as to how B can get the diamond

You have to use a double key..Similar to Bank locker ...The main key is with the Manager of the Bank..But unless the private key of customer is inserted the locker will not open
 
If you have shell access to the server then you can generate the keys insitu...No need of any key movement..This would be the best solution
 
You have to use a double key..Similar to Bank locker ...The main key is with the Manager of the Bank..But unless the private key of customer is inserted the locker will not open

The issue is always initial key exchange, so the original problem remains.

In order for the essence of problem be solvable by non-technical people, the sample problem is about a person wanting to send diamonds locked in a box and sending by a courier to person B. There is a restriction that key to the lock containing the diamond cannot be transmitted by the courier but B and A can send each other anything else via the courier.

The issue is how can B able to get access to the diamond.

What steps are needed for the above to be possible :)?
 
If people are interested they can provide their solution here.

Let us say A wants to mail an expensive piece of diamond over a special courier service to B.

Let us assume that courier people are inquisitive and will steal the diamond if it is not locked in a box. Let us assume that they will not be able to break the lock because key blanks for such a lock is not available.

Now if A locks the diamonds in a box and sends it, B will not have the key to open the lock to get at the diamond.

A says he cannot mail the key separately because it is kind of unique key and he cannot afford that it be lost in transit.

How can B get the diamond?


===============================

It is much like when you are I try to open our email account. Anything in transit has to be encrypted so that no one can steal content. The receiver has to have a way of decrypting but the receiver does not have the key used to encrypt.. So one can see the parallel to the example above.

While reading this article, it will be nice if anyone is able to provide a solution to the puzzle above as to how B can get the diamond

Please state all the pre-conditions or given facts of the "situation". I have noted down what are given by you to be indicative. Please state all of them so that I can try to give a solution.

1. A and B are two entities parted by a large space. They are not in sight of each other.

2. A sends a costly piece of Diamond to B and B knows that the diamond is coming. It is a deal and any deal requires two entities and both have knowledge of the deal.

3. The diamond is locked in a box and can not be opened without the key.

4. The box can not be broken.

5. A after placing the diamond in the box and locking it, can not send the key to B.

6. A will not mail the key separately to any one including to B.

Are these the only given facts of the "situation" or are there any other implied ones. If they are there please state them so that the problem can be looked at with the full knowledge of all the assumptions.
 
If people are interested they can provide their solution here.

Let us say A wants to mail an expensive piece of diamond over a special courier service to B.

Let us assume that courier people are inquisitive and will steal the diamond if it is not locked in a box. Let us assume that they will not be able to break the lock because key blanks for such a lock is not available.

Now if A locks the diamonds in a box and sends it, B will not have the key to open the lock to get at the diamond.

A says he cannot mail the key separately because it is kind of unique key and he cannot afford that it be lost in transit.

How can B get the diamond?


===============================

It is much like when you are I try to open our email account. Anything in transit has to be encrypted so that no one can steal content. The receiver has to have a way of decrypting but the receiver does not have the key used to encrypt.. So one can see the parallel to the example above.

While reading this article, it will be nice if anyone is able to provide a solution to the puzzle above as to how B can get the diamond
Some solutions :)

1) A has several locks (auto locking types) to which only B has the key. He uses one of it.
2) Another variant of 1 above: A uses such a lock which is locked by one key and opened by another; the former is with A and the latter with B
3) A sends B a code (this mandates that they should have agreed on it some time earlier). This code (say 123) could be used to make the key to the lock which A uses. This could even be engraved on the box.
 
Please state all the pre-conditions or given facts of the "situation". I have noted down what are given by you to be indicative. Please state all of them so that I can try to give a solution.

1. A and B are two entities parted by a large space. They are not in sight of each other.

2. A sends a costly piece of Diamond to B and B knows that the diamond is coming. It is a deal and any deal requires two entities and both have knowledge of the deal.

3. The diamond is locked in a box and can not be opened without the key.

4. The box can not be broken.

5. A after placing the diamond in the box and locking it, can not send the key to B.

6. A will not mail the key separately to any one including to B.

Are these the only given facts of the "situation" or are there any other implied ones. If they are there please state them so that the problem can be looked at with the full knowledge of all the assumptions.

This is a good enumeration, but wanted to clarify the assumptions a bit more

  • A is sending to B, often unsolicited and B does not know the exact content. They only communicate via the courier service and not able to see each other. The main point is that the content should not be available to the courier person to pry open and take the content.
  • There is no prior communications between A and B except they both know they can send each other items via a courier
  • While we are concentrating how a valuable item is transmitted from A to B via a courier service (B is not waiting for the content and does not know what the content is) , the approach of how this is done should be applicable to thousands or even millions of users using this courier service.
  • That means A could be sending items to B and many others via the courier service, and he simply locks the items using his special lock. The only key that can open the lock is only with A and he will never transmit his key.
 
Some solutions :)

1) A has several locks (auto locking types) to which only B has the key. He uses one of it.
2) Another variant of 1 above: A uses such a lock which is locked by one key and opened by another; the former is with A and the latter with B
3) A sends B a code (this mandates that they should have agreed on it some time earlier). This code (say 123) could be used to make the key to the lock which A uses. This could even be engraved on the box.

1. It is not auto locking and B does not have the key
2. It is possible to have a key pair , where a locks is secured with one key, and can open with another. Unfortunately, when A initiates a transaction B does not have any special key. It is the first transaction between them.
3. There is no prior communication, etching a code is equivalent to revealing part of the make of key needed (which is insecure)

In the previous post, I have clarified the assumptions even more !
 
1. It is not auto locking and B does not have the key
2. It is possible to have a key pair , where a locks is secured with one key, and can open with another. Unfortunately, when A initiates a transaction B does not have any special key. It is the first transaction between them.
3. There is no prior communication, etching a code is equivalent to revealing part of the make of key needed (which is insecure)

In the previous post, I have clarified the assumptions even more !

The assumptions are such that it is extremely tough.

Let us try.

The scenario: A certain Jack sends a communication to a certain Peter through a channel which has certain rules of conveying messages. It sends every letter and other characters of the message as given by the sender and faithfully reproduces it at the end of the receiver.

The problem: How can Jack send the communication or message through the communication channel so that it reaches Peter without distortion or attenuation. The message should not be readable by anyone else.

The suggested method:

Suppose Jack wants to send a "good morning" to Peter. He starts coding his message as g plus 5, o plus 5, o plus 5 d plus 5 and the zero plus 5 (for space) then m+5, o+5 etc., till the message is completed. In this each letter plus 5 would means the fifth letter after the given letter. Thus the message when coded would look like this ( the order is the ascending order of the alphabets abc etc.,) and after the 22nd alphabet it will get back to a, b etc., as there are only 26 letters. Now let us code the message:
g+5 = l, o+5=t, 0+5=t, d+5=i, m+5=r,o+5=t, r+5=w, n+5=s, i+5=n, n+5=s

goodmorning will become equal to lttirtwsns.

Further complexities can be added to the encryption in several ways to make it difficult to decypher.

The common number in the above encryption 5 can be the date of sending the message by sender or an arithmatical relation to the date which can be agreed upon in advance in the scheme of communication and kept a secret. In the case of groups to which the message is sent it can even be related to the page number in the B hagavad Gita Gorakpur edition volume's given page number which can again be the first letter of the receiver's name. So the possibilities are many.

This was an old method and there is nothing new about it as this was used during the World War II days by spies. The requirement will be now to write out an algorithm and use it to load a suitable machine language syntax in the computer so that the encryption and decryption are done in a flash.

So Mr. tks, it is lttirtwsns to you as I am posting this in the night here in India. LOL.
 
The assumptions are such that it is extremely tough.

Let us try.

The scenario: A certain Jack sends a communication to a certain Peter through a channel which has certain rules of conveying messages. It sends every letter and other characters of the message as given by the sender and faithfully reproduces it at the end of the receiver.

The problem: How can Jack send the communication or message through the communication channel so that it reaches Peter without distortion or attenuation. The message should not be readable by anyone else.

The suggested method:

Suppose Jack wants to send a "good morning" to Peter. He starts coding his message as g plus 5, o plus 5, o plus 5 d plus 5 and the zero plus 5 (for space) then m+5, o+5 etc., till the message is completed. In this each letter plus 5 would means the fifth letter after the given letter. Thus the message when coded would look like this ( the order is the ascending order of the alphabets abc etc.,) and after the 22nd alphabet it will get back to a, b etc., as there are only 26 letters. Now let us code the message:
g+5 = l, o+5=t, 0+5=t, d+5=i, m+5=r,o+5=t, r+5=w, n+5=s, i+5=n, n+5=s

goodmorning will become equal to lttirtwsns.

Further complexities can be added to the encryption in several ways to make it difficult to decypher.

The common number in the above encryption 5 can be the date of sending the message by sender or an arithmatical relation to the date which can be agreed upon in advance in the scheme of communication and kept a secret. In the case of groups to which the message is sent it can even be related to the page number in the B hagavad Gita Gorakpur edition volume's given page number which can again be the first letter of the receiver's name. So the possibilities are many.

This was an old method and there is nothing new about it as this was used during the World War II days by spies. The requirement will be now to write out an algorithm and use it to load a suitable machine language syntax in the computer so that the encryption and decryption are done in a flash.

So Mr. tks, it is lttirtwsns to you as I am posting this in the night here in India. LOL.

OK, lttirtwsns!

1. The original problem stated method of transmission independent of the content. That is still open. It seems hard but solution represents a breakthrough and is used in communications. The method is few simple steps - this is just to say it is deceptively simple

2. The
lttirtwsns represents encoding since decoding does not require a key but an agreed upon scheme. The example used is based on what would be termed ROT(5) or Rotation by 5 characters. Back in late 1970s and early 1980s, a manifestation of the internet was in communicating with people like this forum called Usenet. There people used to post objectionable content and jokes using ROT(13) encoded format so that one would have to decode it to read the content

3. In computer communications there is encoding, encryption (requires a key and cannot be easily broken), hashing (to validate integrity of the content by the recipient), and Obfuscation (to prevent people from understanding the meaning of something even if something is reverse engineered)

The problem posed with A trying to send something valuable (like diamond) using a lock box locked with a unique lock for which he alone has a key is needed to solved for initial communication. In that communication it is possible to share how the future communications will work for example.

I appreciate the effort to try to crack this problem!
 
A locks the box with lock X and sends to B.
B receives the box and locks with lock Y and sends to A
A receives the box and removes his lock x and sends to B.. ( Box has still lock Y)
B receives the box and opens lock Y and gets the diamond.
 
A locks the box with lock X and sends to B.
B receives the box and locks with lock Y and sends to A
A receives the box and removes his lock x and sends to B.. ( Box has still lock Y)
B receives the box and opens lock Y and gets the diamond.

Intelligent response!
 
A locks the box with lock X and sends to B.
B receives the box and locks with lock Y and sends to A
A receives the box and removes his lock x and sends to B.. ( Box has still lock Y)
B receives the box and opens lock Y and gets the diamond.


Sri mskmoorthy -

Indeed the correct answer :)

In fact in the opening post there is a mention of Diffie-Hellman algorithm.

The above is precisely an example of its implementation of two people establishing initial communications and exchange keys (instead of diamonds for ongoing ease of secure transactions).

So in the beginning A will send to B a pair of keys which are needed to open future locks. But to get the keys securely , the above algorithm or steps are used so that B has the key(s) that will help unlock all future items from A without having to go back and forth.

"Diffie Hellman is an algorithm used to establish a shared secret between two parties. It is primarily used as a method of exchanging cryptography keys for use in symmetric encryption algorithms like AES. The algorithm in itself is very simple."

Reference: https://en.wikipedia.org/wiki/Diffie–Hellman_key_exchange

The original problem was posed as follows with the following story:

Jan and Maria have fallen in love (via the internet) and Jan wishes to mail her a ring. Unfortunately,
they live in the country of Kleptopia where anything sent through the mail will be stolen unless it
is enclosed in a padlocked box. Jan and Maria each have plenty of padlocks, but none to which the
other has a key. How can Jan get the ring safely into Maria’s hands?


Thanks to Sri Vaagmi, Sri mskmoorthy, Sri vgane, Sri auh to have participated in this thread :)
 
Status
Not open for further replies.

Latest ads

Back
Top