Smart Cards basic security issues -


i have basic ambiguities related smart cards, hope can answer these questions:

does smart cards have key encription or authentication purposes (not speaking of pin), inserted in during personalization phase ? if has, 1 key purposes (authentication, encription) or there more of them (assuming single application card) ? in order authentication (between card , terminal) fulfilled how terminal learns cards encription key (i understood authentication take place both parties should have same key). red part 3 , 4 of iso7816, didn't find details regarding matter.

thanks

disclaimer: tale working experience since didn't receive proper training course, wording seems weird

let's java card tiny computer little bit of processing power , memory have os (e.g. java card vm) installed on them

you need have correct key install application (applet) on them (should come along sdk card manufacturer)

it may have usable applet installed, example memory storage (you can put data, data) if applet store secured data, may need write 1 yourself. , authentication on application layer, of course not mention in iso7816-4.

does smart cards have key ...

it on os level , need 1 tamper applet inside (intstall/delete), more on application level , may differ lot applet vendor

... how terminal learns cards encription key ...

either have symmetrical key hard-coded before hand (in terminal code , in applet code) once both come in contact first time, generate new key , replace blah blah blah

or can put different generated key along applet file when install applet (at least gemalto can) use pinpad or other mean input key on terminal well


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more