Study on Cryptographic Application for Smart Card 2001. 3.14. Course Title : Computer Security & E-Payment System Faculty : 김 광 조 2001027 김 종 승 2001093.

Slides:

Advertisements

Similar presentations

Efficient Public Key Infrastructure Implementation in Wireless Sensor Networks Wireless Communication and Sensor Computing, ICWCSC International.

Advertisements

SECURITY IN E-COMMERCE VARNA FREE UNIVERSITY Prof. Teodora Bakardjieva.

Cryptographic Security Presented by: Josh Baker October 9 th, CS5204 – Operating Systems.

FIT3105 Smart card based authentication and identity management Lecture 4.

Information Security of Embedded Systems : Public Key Cryptosystems, Communication Prof. Dr. Holger Schlingloff Institut für Informatik und Fraunhofer.

CMSC 414 Computer and Network Security Lecture 6 Jonathan Katz.

CMSC 414 Computer and Network Security Lecture 15 Jonathan Katz.

Trust Level Based Self-Organized Routing Protocol for Secure Ad Hoc Networks Li Xiaoqi, GiGi 12/3/2002.

Cryptographic Technologies

Henric Johnson1 Chapter3 Public-Key Cryptography and Message Authentication Henric Johnson Blekinge Institute of Technology, Sweden

FIT5037 Advanced Network Security --- Modern Computing and Security --- Lecture 1.

Cryptography1 CPSC 3730 Cryptography Chapter 9 Public Key Cryptography and RSA.

Introduction to Computer and Network Security Iliano Cervesato 26 August 2008 – Modern Cryptography.

Remarks on Voting using Cryptography Ronald L. Rivest MIT Laboratory for Computer Science.

Lecture 4 Cryptographic Tools (cont) modified from slides of Lawrie Brown.

Network Security Essentials Fifth Edition by William Stallings Fifth Edition by William Stallings.

ASYMMETRIC CIPHERS.

Public Key Model 8. Cryptography part 2.

© 2012 Cengage Learning. All Rights Reserved. Principles of Business, 8e C H A P T E R 13 SLIDE Types of Production Production Planning.

CS5204 – Fall Cryptographic Security Presenter: Hamid Al-Hamadi October 13, 2009.

1 Public-Key Cryptography and Message Authentication Ola Flygt Växjö University, Sweden

© Neeraj Suri EU-NSF ICT March 2006 DEWSNet Dependable Embedded Wired/Wireless Networks MUET Jamshoro Computer Security: Principles and Practice Slides.

1 Introduction to Security and Cryptology Enterprise Systems DT211 Denis Manley.

Lecture slides prepared for “Computer Security: Principles and Practice”, 2/e, by William Stallings and Lawrie Brown, Chapter 21 “Public-Key Cryptography.

Lecture 19 Page 1 CS 111 Online Symmetric Cryptosystems C = E(K,P) P = D(K,C) E() and D() are not necessarily the same operations.

Epayment System using Java April, Computer Security and Electronic Payment System Cho won chul Kim Hee Dae Lee Jung Hwan Yoon Won Jung.

Network Security. Security Threats 8Intercept 8Interrupt 8Modification 8Fabrication.

CS 627 Elliptic Curves and Cryptography Paper by: Aleksandar Jurisic, Alfred J. Menezes Published: January 1998 Presented by: Sagar Chivate.

Symmetric versus Asymmetric Cryptography. Why is it worth presenting cryptography? Top concern in security Fundamental knowledge in computer security.

Learning Aid Type Text Page 206 MGS GROUP C Svitlana Panasik.

Asymmetric Key Signatures David Evans and Samee Zahur CS4501, Fall 2015.

CRYPTOGRAPHY How does it impact cyber security and why you need to know more?

LOGO Hardware side of Cryptography Anestis Bechtsoudis Patra 2010.

Anonymous Authentication in Group Course Title: Network Security Faculty : Kwangjo Kim Jongseong Kim.

Elliptical Curve Cryptography Manish Kumar Roll No - 43 CS-A, S-7 SOE, CUSAT.

Public Key Cryptography. symmetric key crypto requires sender, receiver know shared secret key Q: how to agree on key in first place (particularly if.

1 Public-Key Cryptography and Message Authentication.

Cryptography and Network Security Chapter 9 - Public-Key Cryptography

Computer Security: Principles and Practice First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown Chapter 2 – Cryptographic.

Some Perspectives on Smart Card Cryptography

Encryption. What is Encryption? Encryption is the process of converting plain text into cipher text, with the goal of making the text unreadable.

Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED.

1 Lect. 20. Identification. 2  Entity Authentication (Identification) Over the communication network, one party, Alice, shows to another party, Bob,

Sensor Network Security through Identity-Based Encryption

DPA Countermeasures by Improving the Window Method Kouichi Itoh, Jun Yajima, Masahiko Takenaka and Naoya Torii Workshop on Cryptographic Hardware and Embedded.

Chapter 3 – Public Key Cryptography and RSA (A). Private-Key Cryptography traditional private/secret/single-key cryptography uses one key shared by both.

ICOM 5995 (crypto) - Noack Crypto - Administrivia Prontuario - Please time-share and ask questions Info is in my homepage amadeus.uprm.edu/~noack/ Make.

Intro to Cryptography Lesson Introduction

Electronic Commerce School of Library and Information Science PGP and cryptography I. What is encryption? Cryptographic systems II. What is PGP? How does.

Elliptic Curve Cryptography Celia Li Computer Science and Engineering November 10, 2005.

Certicom Corporation Open House June 3, Certicom Corp. Founded in 1985 by Dr. Scott Vanstone Innovators in security technology –Leading supplier.

Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.

Lecture 5 Page 1 CS 236 Online More on Cryptography CS 236 On-Line MS Program Networks and Systems Security Peter Reiher.

Paper On Cryptography CS300 Technical Paper Review Avinash Chambhare Abdus Samad.

Lecture 14 Public Key Cryptography and RSA. Summary principles of public-key cryptography principles of public-key cryptography RSA algorithm, implementation,

Cryptographic Security Aveek Chakraborty CS5204 – Operating Systems1.

Security. Cryptography (1) Intruders and eavesdroppers in communication.

Chapter 9 – Public Key Cryptography and RSA Every Egyptian received two names, which were known respectively as the true name and the good name, or the.

CSEN 1001 Computer and Network Security Amr El Mougy Mouaz ElAbsawi.

Computer Security Course Syllabus 1 Computer Security Lecturer : H.Ben Othmen.

Efficient Montgomery Modular Multiplication Algorithm Using Complement and Partition Techniques Speaker: Te-Jen Chang.

Motivation Basis of modern cryptosystems

Department of Computer Science Chapter 5 Introduction to Cryptography Semester 1.

CMSC 414 Computer and Network Security Lecture 2 Jonathan Katz.

Elliptic Curve Public Key Cryptography Why ? ● ECC offers greater security for a given key size. ● The smaller key size also makes possible much more compact.

Outline Desirable characteristics of ciphers Uses of cryptography

Outline Desirable characteristics of ciphers Uses of cryptography

DATA COMMUNICATION Lecture-3.

Presentation transcript:

Study on Cryptographic Application for Smart Card Course Title : Computer Security & E-Payment System Faculty : 김 광 조 김 종 승 이 정 연

Compute Security & E-Payment System T erm Project 2 INDEX ▣ 1. Motivation ▣ 2. Survey Problems Related with Smart Card ▣ 3. Identify Efficient Cryptosystems for Smart Card ▣ 4. Future Work ▣ 5. Time Schedule ▣ 6. References

Compute Security & E-Payment System T erm Project 3 1. Motivation ▣ 1. To reduce trials and errors to design COS later using results of this term project. ▣ 2. To know How to work smart card and what architectures are. ▣ 3. To implement efficient crypto algorithms within various constraints. ▣ 4. To know secure, non-secure requirements of smart card. ▣ 5. To establish basis for our thesis.

Compute Security & E-Payment System T erm Project 4 2. Problems related with smart card ▣ 1. Constrained memory, limited computing power, slow transmission rate, use low voltage of IC chips ▣ 2. Not compatible each other ▣ 3 Different IC chip specifications ▣ 4. No standard design principles ▣ 5. Difficult Upgrade ▣ 6. Grows up customer’s needs…

Compute Security & E-Payment System T erm Project 5 3. Efficient Cryptosystem for Smart Card ▣ 1. Smaller key size but more strong against attacks ▣ 2. Less use memory ▣ 3. Faster than others ▣ 4. Using combination of symmetric & asymmetric key cryptosystems ▣ 5. Compatible with any IC chip products ▣ 6. Follow international standards….

Compute Security & E-Payment System T erm Project 6 4. Future Work ▣ 1. Characteristics of smart card systems ▣ 2. International Standards ▣ 3. Specification of IC chips ▣ 4. COS design criteria ▣ 5. Analyze and improve computation of cryptosystems ▣ 6. Current issues ▣ 7. Suggest more practical model of smart card systems

Compute Security & E-Payment System T erm Project 7 5.Time Schedule Time Table Work 3 th 4 th 5 th 6 th 7 th 8 th 9 th 10 th 11 th 12 th 13 th 14 th 15 th Characteristics of smart card International Standards Specification of IC chips COS design criteria Analyze &improve computation of cryptosystems Suggest more practical model

Compute Security & E-Payment System T erm Project 8 6. References ▣ [1] Jorge Ferrari, “Smart Card :A case study”, IBM ▣ [2] Certicom white paper “ECC for smart card” ▣ [3] R. Rivest, A.Shamir “A method for obtaining Digital Signatures and public-key cryptosystems” ▣ [4] C.Kaufman, “network Security Private Communication in a Public word”