forum.math.uoa.gr

Forum του Τμήματος Μαθηματικών
Ημερομηνία 15 Δεκ 2018, 19:55

Όλοι οι χρόνοι είναι UTC + 2 ώρες [ DST ]




Δημιουργία νέου θέματος Απάντηση στο θέμα  [ 1 δημοσίευση ] 
Συγγραφέας Μήνυμα
 Θέμα δημοσίευσης: Breakthroughs in Cryptography
ΔημοσίευσηΔημοσιεύτηκε: 30 Οκτ 2008, 09:52 
Χωρίς σύνδεση
Regular Forumer

Εγγραφη: 01 Οκτ 2007, 02:14
Δημοσ.: 569
Τοποθεσια: Stone(d)city
AIT is pleased to invite you to a Research Seminar on “Breakthroughs in Cryptography”.
The Seminar will be conducted by Prof. Nikos Komninos.

Date: Monday, November 03, 2008 from 16:30 to 17:30.

Venue: Amphitheater 2A, AIT, 0.8Km Markopoulo Ave., Peania. http://www.ait.edu.gr/utils/HowTo.asp

Participation to the Seminar is free of charge.

You may register at gpis@ait.edu.gr until Monday Morning, 03 November .

An abstract of the presentation together with a short CV of Prof. Nikos Komninos may be found in the following.

====================================================
ABSTRACT
Cryptography is one of the oldest professions of human kind. As soon as the first person realized that it might be desirable to write down a piece of information and there would be undesirable consequences should that piece of information be revealed, the challenge of cryptography and cryptanalysis arose. Classical ciphers such as Scytale, Shift (or Caesar), and Vigenere always reveal statistical information about the actual message. To foil frequency analysis several mechanical cryptographic devices were invented early in the 20th century, among them rotor machines - most famously the Enigma machine used by Germany in World War II.
The development of digital computers and electronics after WWII made possible more complex ciphers. Extensive open academic research into cryptography gave birth to public-key cryptography in 1976 with the most important application of digital signatures. The present security levels of public-key cryptography is based on the difficulty of certain computationally problems, such as the integer factorization or the discrete logarithm problems. Both problems require large numbers and hence large keys to be implemented in public-key ciphers. Until the observation that the discrete logarithm problem under certain finite fields is even harder, allowed keys of “reasonable” size in elliptic curve cryptosystems.
Based on the difficulty of solving computational problems, timed-release cryptography has also come into attention by cryptographic systems designers. Starting in 1993, time lock puzzles and trusted agents have been proposed and designed to decrypt sometime in the future. Furthermore, the fact that with quantum computing we may solve practically fast cryptographic problems, quantum cryptography potentials are already being considered by cryptographic community. In 1984 for example, the first quantum key distribution protocol was proposed where two parties agreed upon a shared secret only known to them.
This presentation is a voyage in time where history meets future; classical ciphers meet rotors; symmetric key ciphers meet public-key and digital signatures; current encryption meets future decryption; and conventional crypto meets quantum cryptography.

_________________
''Pure mathematics is, in its way, the poetry of logical ideas.'' - Albert Einstein


Κορυφή
 Προφίλ  
 
Τελευταίες δημοσιεύσεις:  Ταξινόμηση κατά  
Δημιουργία νέου θέματος Απάντηση στο θέμα  [ 1 δημοσίευση ] 

Όλοι οι χρόνοι είναι UTC + 2 ώρες [ DST ]


Μελη σε συνδεση

Μέλη σε αυτή την Δ. Συζήτηση : Δεν υπάρχουν εγγεγραμμένα μέλη και 1 επισκέπτης


Δεν μπορείτε να δημοσιεύετε νέα θέματα σε αυτή τη Δ. Συζήτηση
Δεν μπορείτε να απαντάτε σε θέματα σε αυτή τη Δ. Συζήτηση
Δεν μπορείτε να επεξεργάζεστε τις δημοσιεύσεις σας σε αυτή τη Δ. Συζήτηση
Δεν μπορείτε να διαγράφετε τις δημοσιεύσεις σας σε αυτή τη Δ. Συζήτηση

Αναζήτηση για:
Μετάβαση σε:  
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group