The document discusses automatic teller machines (ATMs) and the underlying systems that support ATM transactions. It covers topics such as the data stored on ATM cards using magnetic stripes, algorithms for generating and validating card numbers, network protocols for connecting ATMs to host systems, common types of ATM machines, the transaction process between an ATM, host processor, and customer's bank, and modeling ATM systems using UML diagrams including use case, sequence, state, and collaboration diagrams.
The document discusses automatic teller machines (ATMs) and the underlying systems that support ATM transactions. It covers topics such as the data stored on ATM cards using magnetic stripes, algorithms for generating and validating card numbers, network protocols for connecting ATMs to host systems, common types of ATM machines, the transaction process between an ATM, host processor, and customer's bank, and modeling ATM systems using UML diagrams including use case, sequence, state, and collaboration diagrams.
The document discusses automatic teller machines (ATMs) and the underlying systems that support ATM transactions. It covers topics such as the data stored on ATM cards using magnetic stripes, algorithms for generating and validating card numbers, network protocols for connecting ATMs to host systems, common types of ATM machines, the transaction process between an ATM, host processor, and customer's bank, and modeling ATM systems using UML diagrams including use case, sequence, state, and collaboration diagrams.
Existing (Jan 23, 2014) payment instrument, being an instrument that enables a holder Existing (Nov 23, 2007) an institution, hereby payment is alloed to be made to Existing (Aug 2, 1997) applications." This classifies an user ith a different Existing (Apr 13, 2005) ! Possible Type of "ata stored in #agnetic $tripe Existing (Jan 2, 2010) #ainly magnetic strip hold the folloing information% Existing (Jan 2, 2010) ! Process of $toring "ata in #agnetic $tripe Card Existing (Jan 2, 2010) trac& one and to. 'ut third trac& is not alays used. Trac& Good not alays used. Trac& three mainly intended to support offline Good transactions. #agnetic $tripe has the data ith (arying Good (arying densities. "ifferent encoding techni)ues are used to Good ! *lgorithm use for Card +umber ,eneration Existing (Jan 2, 2010) and encoding. It is also called mod -. algorithms. Card Good -. algorithms. Card number must be -/ to -0 digits. *nd Good to -0 digits. *nd the last digit is the chec& digit. To Good the chec& digit. To calculate chec& "igit% Good ! #ultiply all the digits in odd positions (The Good ! If any one is greater than 1 subtract 1 from Existing (Mar 1, 2007) ! *dd the e(en numbered digits (the second, fourth, Good multiple of -.. $o if you got 02 in the pre(ious step the Existing (!t 23, 2005) digit ould be 3. 4ou can calculate the digit in code using Existing (!t 23, 2005) 5or Credit Card +umber 6alidation use -. mod *lgorithm% Existing (Jan 2, 2010) 5irst step% number is re(ersed 7 then e(ery second Good magnetic strip card. It is also a data carrier hich electronically Existing (Jan 2, 2010) and rites data. *T# cards mainly a debit card. Good the cardholder. *T# card mainly ha(e to things encoded Good arbitrary bytes. That is decided by the ban& ho it is generated Existing (Jan 2, 2010) generated and used. *lso the *T# card contains% Good The *T# Card storage 8Record 5ormat consists of% Good TR*C9 -8 International *ir Transport *ssociation Existing (Mar 2", 2005) #I+T$ : #utual Institutions +ational Transfer $ystem Good I$; : International $tandards ;rgani<ation Good ! Intended for off8host application and for on8host Good ! 5or *T# card, e(ery customer has to open an account Good ! +eed to fill up a re)uisition form for *T#="ebit Existing (Jan 2, 2010) ood 5irst si> digits are fi>ed for 'an& customers, Good Regional code is used for distinguish beteen different Existing (Jan 2, 2010) of transaction. *s people do not feel comfortable to carry Existing (Jan 2, 2010) nearby *T# machine, insert their *T# card, and ta&e the re)uired Existing (#$% 13, 2010) re)uired amount. *s these *T# machines are found in most Existing (#$% 13, 2010) supermar&ets, tons, and e(en hotels. Existing (#$% 13, 2010) host processor. The host processor is necessary so that Existing (#$% 13, 2010) re)uesting the cash. The Internet $er(ice Pro(ider (I$P) also Good in this action. They act as the gateay to the intermediate Existing (#$% 13, 2010) There are mainly to types of *T#?s hich differ Existing (#$% 13, 2010) has a @8ire, point to point dedicated telephone line Existing (#$% 13, 2010) host processor. These types of machines are preferred in &'$!( )n *$tai+ (olume is high. They are considered high end and the operating Existing (#$% 13, 2010) toll free number. *s these are normal connections their initial Existing (#$% 13, 2010) ! Input and output de(ices of the #achine Existing (Mar 12, 2011) transactions. *T# is simply a data terminal ith to input Good output de(ices. Ai&e any other data terminal, the *T# has Existing (#$% 1, 2001) to connect to, and communicate through, a host processor. Existing (#$% 1, 2001) or credit card. The host processor uses this information Existing (#$% 1, 2001) (cash ithdraal, balance in)uiry, etc.) and for hat amount. Existing (#$% 1, 2001) for hat amount. *lso, the ban& re)uires the cardholderBs Existing (#$% 1, 2001) transaction process. Aeased8line machines commonly use a monochrome Existing (#$% 1, 2001) tube) display. "ial8up machines commonly use a monochrome Existing (#$% 1, 2001) cash8dispensing mechanism. The entire bottom portion of most small ,$su+ts- 3./ 0ni1u$ &ont$nt the card holder. This information is passed on to the host Existing (#$% 13, 2010) the *T# machine. The host processor chec&s these details Existing (#$% 13, 2010) authori<ed ban&. If the details are found correct, the re)uested Good found correct, the re)uested cash by the card holder is Good processor?s account. *fter this function is carried out, the Existing (#$% 13, 2010) is carried out, the processor sends an appro(al code to Existing (#$% 13, 2010) be transferred. 'asically *T# Good Cnits are connected to host computer and host Good all the ban&s. Total *T# maintenance, e)uipment facilities Good pro(ided by +P. *lso card issue, report etc are pro(ided Good *T# connection. *s 5iber optic gi(en highest data rate that Good are less costly. 'ut the throughput rate is lo as it is Good strongly needed. *T# is connected to host computer and the Good up using modem. $ome places here ;utput is (ery important Existing (Jan 2, 2010) is important. Dost computer mainly or& as a gateay beteen Good connection is E.3F. It is a pac&et sitch data netor& protocol Existing (Jan 2, 2010) to end systems. E.3F netor& de(ices fall into / general Good ! "TE de(ices% PC or netor& hosts (subscribers) Good ! P$+% are sitches 7 transfer data to "TE to "TE Existing (Jan 2, 2010) consistency of actions, (alues, methods, measures, principles, and Existing (Nov 20, 200.) measures, principles, and outcomes. Communication systems chec& Good security attac&s. $ome integrity functions used for security Good error control, since there are similarities beteen the Existing (Ju+ 15, 1999) the purposes. Therefore it is essential to chec& the integrity Good The security of *T# transactions relies mostly Existing (Jan 27, 2012) #an8in8the8middle attac&s, here criminals ha(e attached fa&e &eypads Existing (#$% 15, 2009) e>isting machines. These ha(e then been used to record customersB Existing (2$p 1., 2007) common feature. *T#s include many functions hich are not Good ban& account, such as% Existing (Nov 3, 200.) recognition, acceptance, and recycling Existing (Ma3 2., 2014) ta>es (utilities, phone bills, $ecurity, etc) Good ! Aoading monetary (alue into stored (alue cards Existing (Mar 24, 2011) problem domain, ith the aim of producing a conceptual model Existing (Ma3 14, 2014) being analy<ed. The identified obGects reflect entities Good system should loo&. It analyses the structure and substructure Existing (2$p 1", 2010) based on obGects, attributes, operations and relationships. Existing (2$p 1", 2010) in 5igure /8@, the 'an& Customer can ithdra cash from Good from an account, transfer funds beteen accounts, or deposit Existing (#$% 1, 2001) beteen accounts, or deposit funds to an account. These correspond Existing (#$% 1, 2001) to an account. These correspond to specific goals that Existing (#$% 1, 2001) ithdra from. The system (erifies that it has sufficient Existing (Mar ", 2012) Pre8conditions% The customer must ha(e a (alid Existing (Mar 31, 2010) Post8conditions% The customer recei(es the amount Good The customerBs account balance is updated in the Existing (Mar 31, 2010) 'an& that ons *T#% (If not the same as the customerBs Existing (2$p 10, 200.) *T# *dministrator% Hants to ensure that the *T# Existing (Mar 31, 2010) The customer inserts *T# card into the *T# machine Existing (Mar 31, 2010) The system (alidates the *T# card and PI+. Existing (Mar 31, 2010) The customer selects the BCash HithdraalB option Good The system prompts the customer to enter the amount Existing (2$p 10, 200.) the transaction, and as&s the customer if he or she ants Existing (Mar ", 2012) Receipts $creen. The system eGects the *T# card, pro(ides Good the *T# card, pro(ides the cash, prints the receipt and Existing (2$p 10, 200.) enter a (alid PI+. If *T# card is not compatible8The system Good error message. The customer has entered an amount that Good The system reGects the transaction 7 displays an Existing (Mar ", 2012) to deposit to. If the transaction is appro(ed, the machine Existing (Mar ", 2012) transaction is appro(ed, the machine accepts from the customer containing Good Pre8conditions% The customer must ha(e a (alid Existing (Mar 31, 2010) has deposited. The customerBs account balance is updated Existing (Mar ", 2012) Customer% Hants )uic&, accurate ithdraal of cash. Existing (Mar 31, 2010) 'an&% Hants to gi(e fast, accurate and reliable Existing (Mar 31, 2010) *T# *dministrator% Hants to ensure that the *T# Existing (Mar 31, 2010) relationships disco(ered. If a class uses another class as a collaborator, Good collaborator, or sends a message to an obGect of that Existing (#$% 1, 2002) an interaction, then there must either be an association Existing (#$% 1, 2002) those classes, lin&ing the "sending" class to an obGect Good system should or&. It analyses the system beha(ior, including Existing (2$p 1", 2010) system beha(ior, including se)uence and collaboration diagrams, Existing (Mar ", 2012) collaboration diagrams, acti(ity diagram, and state diagram. Existing (Mar ", 2012) beteen states, and a condition of that transition occurring Existing (Apr 1, 2002) s)uare braced. This condition is called a guard as shon Good 5igure /80 $tate "iagrams for *T# $ystem Good 5igure /8I $tate "iagrams for Transaction Good Collaboration "iagram. Interactions beteen obGects are represented Existing (Mar ", 2012) an association. The order of the messages along the lin&s Existing (Apr 1, 2002) time se)uence. Hithin a se)uence diagram an obGect is shon Existing (!t 22, 200.) bo> at the top. The se)uence diagram of the abo(e C#A class Existing (!t 22, 200.) transactions. The communication beteen to obGects represented Existing (Mar ", 2012) on that arro, the (ertical lines sho the life of the Existing (!t 22, 200.) #odeling Aanguage, depicts ho components are ired together Existing (Jan 25, 2009) softare systems. Components diagrams can be used to illustrate &'$!( )n *$tai+ deployment targets. "eployment diagrams sho the allocation &'$!( )n *$tai+ beteen them. "eployment of an artifact to a node is indicated Existing (Mar ", 2012) The barriers for implementing *T# units are number Good ! #ar&et si<e and business re(enue for the (endors Existing (Nov 23, 2007) ! Hho ill be the "ultimate" recogni<ed certification Good ! Do ill the minimum (security) re)uirements Good than at a P;$, has recently become more idespread. Recent Good more idespread. Recent occurrences of *T# fraud range from Good modifications to di(ert, or trap the dispensed currency. Existing (2$p 10, 2002) effecti(e polices, procedures, and controls to meet the ne Existing (!t 22, 2003) by e8ban&ing. There are three basic types of *T# attac&s Good ! *ttempts to steal a customerJs ban& card information Existing (2$p 7, 2009) ! Computer and +etor& attac&s against *T#Js to Existing (2$p 7, 2009) customerBs card. * later (ariant of this approach is to trap Existing (Nov 5, 2011) Aebanese loop. Hhen the customer gets frustrated by not Existing (*$! 23, 2010) from the machine, the criminal is able to remo(e the card Existing (#$% 15, 2009) customerBs account. 'y contrast, a high8tech method of operating Good the userBs PI+. Card data is then cloned onto a second card Existing (#$% 22, 2012) cash ithdraal. The a(ailability of lo8cost commodity ireless Existing (#$% 22, 2012) form of fraud, ith comparati(ely lo ris& to the fraudsters. Existing (#$% 22, 2012) the fraudsters. 5raud at the *T#, although more difficult Good than at a P;$, has become more idespread. Recent occurrences Good modifications to di(ert, or trap the dispensed currency. Existing (2$p 10, 2002) on to function, are the targets of fraud. 5raud against Existing (Apr 15, 2012) se(eral forms. In some cases, ban& frauds occur at *T#s Good denomination, therefore gi(ing the customer more money Existing (#$% 12, 2011) be dispensed. *T# beha(ior change during hat is called &'$!( )n *$tai+ "stand8in" time, here the ban&Bs cash dispensing netor& Existing (Ju+ 1, 2009) maintenance). In order to gi(e customers access to cash, Existing (Mar 15, 2012) access to cash, customers are alloed to ithdra cash up Good ithdraal limit, but still e>ceed the amount of a(ailable Good their account, resulting in fraud. $ome 5rauds related Good captured card, the criminal, usually in close pro>imity Existing (2$p 10, 2002) pro>imity of the *T#, offer support, suggesting the user enter Good the PI+ again, so that he or she is able to (ie the entry Existing (Nov 2., 200") remember the PI+. *fter the consumer lea(es the area, belie(ing Good lea(es the area, belie(ing their card ha(e been captured Good captured by the *T#, the criminal then use a probe (fishing de(ice) Good e>tract the card. Da(ing (ieed the customers PI+ and no Good card in hand, the criminal easily ithdra money from Good off the card. $&imming is the most fre)uently used method Good card trac& data. K$&immersL are de(ices used by criminals Existing (Aug 15, 2010) strip of the card. Reading and deciphering the information Good pro>imity to, or on top of, the actual card reader?s input Good reader?s input slot, so it is able to read and record the information Good trac& of the card. The de(ice is then remo(ed, alloing the Existing (Aug 15, 2010) direct obser(ation, atching hat number that person taps onto Good onto the &eypad. The criminal usually positions himself in Existing (Aug 15, 2010) enters their PI+. $ometimes miniature (ideo cameras that are Good to the PI+ Pad, to record the PI+ entry information. Good into its memory. The fa&e PI+ pad is then remo(ed, and recorded Good then remo(ed, and recorded PI+s are donloaded. 5a&e PI+ Existing (Aug 15, 2010) are donloaded. 5a&e PI+ pads are almost identical in appearance Good the original. *n additional type of o(erlay is more difficult Good the consumer. This method is used in conGunction ith Good data recorder. Capturing the PI+ is done either inside Good the terminal, or as the PI+ is transmitted to the host Existing (Aug 15, 2010) online PI+ chec&. In order to capture the PI+ internally, Good PI+ internally, the criminal re)uire access to the communication Good the terminal, hich is more easily done at off8premise Good analytical )uestions, determining good effecti(eness measures, Good effecti(eness measures, recogni<ing &ey inter(ention points, and Good inter(ention points, and selecting appropriate responses. * fe &'$!( )n *$tai+ appropriate responses. * fe studies ha(e pro(ided some data on Existing (Aug 15, 2010) ! #ost robberies are committed by a lone offenderMusing Existing (#$% 1, 2002) ! #ost in(ol(e robbing people of cash after they &'$!( )n *$tai+ ! Robberies are somehat more li&ely to occur at Existing (#$% 1, 2002) ! The most common pattern is for the offender to Existing (#$% 1, 2002) ! The offender forces the (ictim to go to an *T# Existing (#$% 1, 2002) ! The offender robs the (ictim of his or her *T# Existing (#$% 1, 2002) ! The offender robs a (ictim standing at an *T# Existing (#$% 1, 2002) ! The offender follos someone ho has Gust ithdran Existing (#$% 1, 2002)