Simple protocol for secure decoy-state quantum key distribution
黑客英语术语

attack 攻击hacker 黑客exploit 漏洞测试工具Firlwall 防火墙Anti-Virus 杀毒软件Virus 病毒worm 蠕虫IDS 入侵监测系统security 安全tool 工具Trojan 木马拒绝服务攻击sniffer 嗅探,从网络中截取密码信息sec-tool 安全工具SQL-injection SQL注入,入侵网站常用password 密码ID 账号Cracker 破解,软件破解File 文件Edit 编辑View 查看Open 打开Message 消息share 共享port 端口IP 网络地址Send 发送Select 选择Source 资源code 代码programming 编程WEB 网站ASP/PHP/JSP 动态脚本语言.NET Framework 微软.NET框架JA V A 爪哇编程语言Options 配置Connection 连接Proxy 代理Advanced 高级Start 启动Stop 停止Vmware 虚拟机Close 关闭Exit 退出1tcpmux TCP Port Service Multiplexer 传输控制协议端口服务多路开关选择器2compressnet Management Utility compressnet 管理实用程序3compressnet Compression Process压缩进程5rje Remote Job Entry远程作业登录7echo Echo回显9discard Discard丢弃11systat Active Users在线用户13daytime Daytime时间17qotd Quote of the Day每日18msp Message Send Protocol消息发送协议19chargen Character Generator字符发生器20FTP-data File Transfer [Default Data]文件传输协议(默认数据口)21ftp File Transfer [Control]文件传输协议(控制)22ssh SSH Remote Login Protocol SSH远程登录协议23telnet Telnet终端仿真协议24?any private mail system预留给个人用邮件系统25smtp Simple Mail Transfer简单邮件发送协议27nsw-fe NSW User System FE NSW 用户系统现场工程师29msg-icp MSG ICP MSG ICP31msg-auth MSG Authentication MSG验证33dsp Display Support Protocol显示支持协议35?any private printer server预留给个人打印机服务37time Time时间38rap Route Access Protocol路煞梦市?39rlp Resource Location Protocol资源定位协议41graphics Graphics图形42nameserver WINS Host Name Server WINS 主机名服务43nicname Who Is"绰号" who is服务44mpm-flags MPM FLAGS Protocol MPM(消息处理模块)标志协议45mpm Message Processing Module [recv]消息处理模块46mpm-snd MPM [default send]消息处理模块(默认发送口)47ni-ftp NI FTP NI FTP48auditd Digital Audit Daemon数码音频后台服务49tacacs Login Host Protocol (TACACS)TACACS登录主机协议50re-mail-ck Remote Mail Checking Protocol远程邮件检查协议51la-maint IMP Logical Address Maintenance IMP(接口信息处理机)逻辑地址维护52xns-time XNS Time Protocol施乐网络服务系统时间协议53domain Domain Name Server域名服务器54xns-ch XNS Clearinghouse施乐网络服务系统票据交换55isi-gl ISI Graphics Language ISI图形语言56xns-auth XNS Authentication施乐网络服务系统验证57?any private terminal access预留个人用终端访问58xns-mail XNS Mail施乐网络服务系统邮件59?any private file service预留个人文件服务60?Unassigned未定义61ni-mail NI MAIL NI邮件?62acas ACA Services异步通讯适配器服务63whois+ whois+WHOIS+64covia Communications Integrator (CI)通讯接口65tacacs-ds TACACS-Database Service TACACS数据库服务66sql*net Oracle SQL*NET Oracle SQL*NET67bootps Bootstrap Protocol Server引导程序协议服务端68bootpc Bootstrap Protocol Client引导程序协议客户端69tftp Trivial File Transfer小型文件传输协议70gopher Gopher信息检索协议71netrjs-1Remote Job Service远程作业服务72netrjs-2Remote Job Service远程作业服务73netrjs-3Remote Job Service远程作业服务74netrjs-4Remote Job Service远程作业服务75?any private dial out service预留给个人拨出服务76deos Distributed External Object Store 分布式外部对象存储77?any private RJE service预留给个人远程作业输入服务78vettcp vettcp修正TCP?79finger Finger FINGER(查询远程主机在线用户等信息)80http World Wide Web HTTP全球信息网超文本传输协议81hosts2-ns HOSTS2 Name Server HOST2名称服务82xfer XFER Utility传输实用程序83mit-ml-dev MIT ML Device模块化智能终端ML设备84ctf Common Trace Facility公用追踪设备85mit-ml-dev MIT ML Device模块化智能终端ML设备86mfcobol Micro Focus Cobol Micro Focus Cobol编程语言87?any private terminal link预留给个人终端连接88kerberos Kerberos Kerberros安全认证系统89su-mit-tg SU/MIT Telnet Gateway SU/MIT终端仿真网关90dnsix DNSIX Securit Attribute Token Map DNSIX 安全属性标记图91mit-dov MIT Dover Spooler MIT Dover假脱机92npp Network Printing Protocol网络打印协议93dcp Device Control Protocol设备控制协议94objcall Tivoli Object Dispatcher Tivoli对象调度95supdup SUPDUP96dixie DIXIE Protocol Specification DIXIE协议规范97swift-rvf Swift Remote Virtural File Protocol快速远程虚拟文件协议98tacnews TAC News TAC(东京大学自动计算机?)新闻协议99metagram Metagram Relay。
TCP常用网络和木马使用端口对照表,常用和不常用端口一览表

TCP常⽤⽹络和⽊马使⽤端⼝对照表,常⽤和不常⽤端⼝⼀览表【开始-运⾏- CMD ,输⼊ netstat -an 然后回车就可以查看端⼝】 端⼝:0 服务:Reserved 说明:通常⽤于分析操作系统。
这⼀⽅法能够⼯作是因为在⼀些系统中“0”是⽆效端⼝,当你试图使⽤通常的闭合端⼝连接它时将产⽣不同的结果。
⼀种典型的扫描,使⽤IP地址为0.0.0.0,设置ACK位并在以太⽹层⼴播。
端⼝:1 服务:tcpmux 说明:这显⽰有⼈在寻找SGI Irix机器。
Irix是实现tcpmux的主要提供者,默认情况下tcpmux在这种系统中被打开。
Irix机器在发布是含有⼏个默认的⽆密码的帐户,如:IP、GUEST UUCP、NUUCP、DEMOS 、TUTOR、DIAG、OUTOFBOX等 端⼝:7 服务:Echo 说明:能看到许多⼈搜索Fraggle放⼤器时,发送到X.X.X.0和X.X.X.255的信息。
端⼝:19 服务:Character Generator 说明:这是⼀种仅仅发送字符的服务。
UDP版本将会在收到UDP包后回应含有垃圾字符的包。
TCP连接时会发送含有垃圾字符的数据流直到连接关闭。
HACKER利⽤IP欺骗可以发动DoS攻击。
伪造两个chargen服务器之间的UDP包。
同样Fraggle 端⼝:21 服务:FTP 说明:FTP服务器所开放的端⼝,⽤于上传、下载。
最常见的攻击者⽤于寻找打开anonymous的FTP服务器的⽅法。
这些服务器带有可读写的⽬录。
⽊马Doly Trojan、Fore、Invisible FTP、WebEx、WinCrash和Blade Runner所开放的端⼝。
端⼝:22 服务:Ssh 说明:PcAnywhere建⽴的TCP和这⼀端⼝的连接可能是为了寻找ssh。
这⼀服务有许多弱点,如果配置成特定的模式,许多使⽤RSAREF库的版本就会有不少的漏洞存在。
端⼝:23 服务:Telnet 说明:远程登录,⼊侵者在搜索远程登录UNIX的服务。
rfc2661.Layer Two Tunneling Protocol L2TP

Network Working Group W. Townsley Request for Comments: 2661 A. Valencia Category: Standards Track cisco Systems A. Rubens Ascend Communications G. Pall G. Zorn Microsoft Corporation B. Palter Redback Networks August 1999 Layer Two Tunneling Protocol "L2TP"Status of this MemoThis document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions forimprovements. Please refer to the current edition of the "InternetOfficial Protocol Standards" (STD 1) for the standardization stateand status of this protocol. Distribution of this memo is unlimited.Copyright NoticeCopyright (C) The Internet Society (1999). All Rights Reserved.AbstractThis document describes the Layer Two Tunneling Protocol (L2TP). STD 51, RFC 1661 specifies multi-protocol access via PPP [RFC1661]. L2TP facilitates the tunneling of PPP packets across an interveningnetwork in a way that is as transparent as possible to both end-users and applications.Table of Contents1.0 Introduction (3)1.1 Specification of Requirements (4)1.2 Terminology (4)2.0 Topology (8)3.0 Protocol Overview (9)3.1 L2TP Header Format (9)3.2 Control Message Types (11)4.0 Control Message Attribute Value Pairs (12)4.1 AVP Format (13)4.2 Mandatory AVPs (14)4.3 Hiding of AVP Attribute Values (14)Townsley, et al. Standards Track [Page 1]4.4.1 AVPs Applicable To All Control Messages (17)4.4.2 Result and Error Codes (18)4.4.3 Control Connection Management AVPs (20)4.4.4 Call Management AVPs (27)4.4.5 Proxy LCP and Authentication AVPs (34)4.4.6 Call Status AVPs (39)5.0 Protocol Operation (41)5.1 Control Connection Establishment (41)5.1.1 Tunnel Authentication (42)5.2 Session Establishment (42)5.2.1 Incoming Call Establishment (42)5.2.2 Outgoing Call Establishment (43)5.3 Forwarding PPP Frames (43)5.4 Using Sequence Numbers on the Data Channel (44)5.5 Keepalive (Hello) (44)5.6 Session Teardown (45)5.7 Control Connection Teardown (45)5.8 Reliable Delivery of Control Messages (46)6.0 Control Connection Protocol Specification (48)6.1 Start-Control-Connection-Request (SCCRQ) (48)6.2 Start-Control-Connection-Reply (SCCRP) (48)6.3 Start-Control-Connection-Connected (SCCCN) (49)6.4 Stop-Control-Connection-Notification (StopCCN) (49)6.5 Hello (HELLO) (49)6.6 Incoming-Call-Request (ICRQ) (50)6.7 Incoming-Call-Reply (ICRP) (51)6.8 Incoming-Call-Connected (ICCN) (51)6.9 Outgoing-Call-Request (OCRQ) (52)6.10 Outgoing-Call-Reply (OCRP) (53)6.11 Outgoing-Call-Connected (OCCN) (53)6.12 Call-Disconnect-Notify (CDN) (53)6.13 WAN-Error-Notify (WEN) (54)6.14 Set-Link-Info (SLI) (54)7.0 Control Connection State Machines (54)7.1 Control Connection Protocol Operation (55)7.2 Control Connection States (56)7.2.1 Control Connection Establishment (56)7.3 Timing considerations (58)7.4 Incoming calls (58)7.4.1 LAC Incoming Call States (60)7.4.2 LNS Incoming Call States (62)7.5 Outgoing calls (63)7.5.1 LAC Outgoing Call States (64)7.5.2 LNS Outgoing Call States (66)7.6 Tunnel Disconnection (67)8.0 L2TP Over Specific Media (67)8.1 L2TP over UDP/IP (68)Townsley, et al. Standards Track [Page 2]9.0 Security Considerations (69)9.1 Tunnel Endpoint Security (70)9.2 Packet Level Security (70)9.3 End to End Security (70)9.4 L2TP and IPsec (71)9.5 Proxy PPP Authentication (71)10.0 IANA Considerations (71)10.1 AVP Attributes (71)10.2 Message Type AVP Values (72)10.3 Result Code AVP Values (72)10.3.1 Result Code Field Values (72)10.3.2 Error Code Field Values (72)10.4 Framing Capabilities & Bearer Capabilities (72)10.5 Proxy Authen Type AVP Values (72)10.6 AVP Header Bits (73)11.0 References (73)12.0 Acknowledgments (74)13.0 Authors’ Addresses (75)Appendix A: Control Channel Slow Start and CongestionAvoidance (76)Appendix B: Control Message Examples (77)Appendix C: Intellectual Property Notice (79)Full Copyright Statement (80)1.0 IntroductionPPP [RFC1661] defines an encapsulation mechanism for transportingmultiprotocol packets across layer 2 (L2) point-to-point links.Typically, a user obtains a L2 connection to a Network Access Server (NAS) using one of a number of techniques (e.g., dialup POTS, ISDN,ADSL, etc.) and then runs PPP over that connection. In such aconfiguration, the L2 termination point and PPP session endpointreside on the same physical device (i.e., the NAS).L2TP extends the PPP model by allowing the L2 and PPP endpoints toreside on different devices interconnected by a packet-switchednetwork. With L2TP, a user has an L2 connection to an accessconcentrator (e.g., modem bank, ADSL DSLAM, etc.), and theconcentrator then tunnels individual PPP frames to the NAS. Thisallows the actual processing of PPP packets to be divorced from thetermination of the L2 circuit.One obvious benefit of such a separation is that instead of requiring the L2 connection terminate at the NAS (which may require along-distance toll charge), the connection may terminate at a (local) circuit concentrator, which then extends the logical PPP session over Townsley, et al. Standards Track [Page 3]a shared infrastructure such as frame relay circuit or the Internet.From the user’s perspective, there is no functional difference between having the L2 circuit terminate in a NAS directly or using L2TP.L2TP may also solve the multilink hunt-group splitting problem.Multilink PPP [RFC1990] requires that all channels composing amultilink bundle be grouped at a single Network Access Server (NAS).Due to its ability to project a PPP session to a location other thanthe point at which it was physically received, L2TP can be used tomake all channels terminate at a single NAS. This allows multilinkoperation even when the calls are spread across distinct physicalNASs.This document defines the necessary control protocol for on-demandcreation of tunnels between two nodes and the accompanyingencapsulation for multiplexing multiple, tunneled PPP sessions.1.1 Specification of RequirementsThe key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT","SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in thisdocument are to be interpreted as described in [RFC2119].1.2 TerminologyAnalog ChannelA circuit-switched communication path which is intended to carry3.1 kHz audio in each direction.Attribute Value Pair (AVP)The variable length concatenation of a unique Attribute(represented by an integer) and a Value containing the actualvalue identified by the attribute. Multiple AVPs make up ControlMessages which are used in the establishment, maintenance, andteardown of tunnels.CallA connection (or attempted connection) between a Remote System and LAC. For example, a telephone call through the PSTN. A Call(Incoming or Outgoing) which is successfully established between a Remote System and LAC results in a corresponding L2TP Sessionwithin a previously established Tunnel between the LAC and LNS.(See also: Session, Incoming Call, Outgoing Call).Townsley, et al. Standards Track [Page 4]Called NumberAn indication to the receiver of a call as to what telephonenumber the caller used to reach it.Calling NumberAn indication to the receiver of a call as to the telephone number of the caller.CHAPChallenge Handshake Authentication Protocol [RFC1994], a PPPcryptographic challenge/response authentication protocol in which the cleartext password is not passed over the line.Control ConnectionA control connection operates in-band over a tunnel to control the establishment, release, and maintenance of sessions and of thetunnel itself.Control MessagesControl messages are exchanged between LAC and LNS pairs,operating in-band within the tunnel protocol. Control messagesgovern aspects of the tunnel and sessions within the tunnel.Digital ChannelA circuit-switched communication path which is intended to carrydigital information in each direction.DSLAMDigital Subscriber Line (DSL) Access Module. A network device used in the deployment of DSL service. This is typically a concentrator of individual DSL lines located in a central office (CO) or local exchange.Incoming CallA Call received at an LAC to be tunneled to an LNS (see Call,Outgoing Call).Townsley, et al. Standards Track [Page 5]L2TP Access Concentrator (LAC)A node that acts as one side of an L2TP tunnel endpoint and is apeer to the L2TP Network Server (LNS). The LAC sits between anLNS and a remote system and forwards packets to and from each.Packets sent from the LAC to the LNS requires tunneling with theL2TP protocol as defined in this document. The connection fromthe LAC to the remote system is either local (see: Client LAC) or a PPP link.L2TP Network Server (LNS)A node that acts as one side of an L2TP tunnel endpoint and is apeer to the L2TP Access Concentrator (LAC). The LNS is thelogical termination point of a PPP session that is being tunneled from the remote system by the LAC.Management Domain (MD)A network or networks under the control of a singleadministration, policy or system. For example, an LNS’s Management Domain might be the corporate network it serves. An LAC’sManagement Domain might be the Internet Service Provider that owns and manages it.Network Access Server (NAS)A device providing local network access to users across a remoteaccess network such as the PSTN. An NAS may also serve as an LAC, LNS or both.Outgoing CallA Call placed by an LAC on behalf of an LNS (see Call, IncomingCall).PeerWhen used in context with L2TP, peer refers to either the LAC orLNS. An LAC’s Peer is an LNS and vice versa. When used in context with PPP, a peer is either side of the PPP connection.POTSPlain Old Telephone Service.Townsley, et al. Standards Track [Page 6]Remote SystemAn end-system or router attached to a remote access network (i.e.a PSTN), which is either the initiator or recipient of a call.Also referred to as a dial-up or virtual dial-up client.SessionL2TP is connection-oriented. The LNS and LAC maintain state foreach Call that is initiated or answered by an LAC. An L2TP Session is created between the LAC and LNS when an end-to-end PPPconnection is established between a Remote System and the LNS.Datagrams related to the PPP connection are sent over the Tunnelbetween the LAC and LNS. There is a one to one relationshipbetween established L2TP Sessions and their associated Calls. (See also: Call).TunnelA Tunnel exists between a LAC-LNS pair. The Tunnel consists of aControl Connection and zero or more L2TP Sessions. The Tunnelcarries encapsulated PPP datagrams and Control Messages betweenthe LAC and the LNS.Zero-Length Body (ZLB) MessageA control packet with only an L2TP header. ZLB messages are usedfor explicitly acknowledging packets on the reliable controlchannel.Townsley, et al. Standards Track [Page 7]2.0 TopologyThe following diagram depicts a typical L2TP scenario. The goal is to tunnel PPP frames between the Remote System or LAC Client and an LNS located at a Home LAN.[Home LAN][LAC Client]----------+ |____|_____ +--[Host]| | |[LAC]---------| Internet |-----[LNS]-----+| |__________| |_____|_____ :| || PSTN |[Remote]--| Cloud |[System] | | [Home LAN]|___________| || ______________ +---[Host]| | | |[LAC]-------| Frame Relay |---[LNS]-----+| or ATM Cloud | ||______________| :The Remote System initiates a PPP connection across the PSTN Cloud to an LAC. The LAC then tunnels the PPP connection across the Internet, Frame Relay, or ATM Cloud to an LNS whereby access to a Home LAN isobtained. The Remote System is provided addresses from the HOME LANvia PPP NCP negotiation. Authentication, Authorization and Accounting may be provided by the Home LAN’s Management Domain as if the userwere connected to a Network Access Server directly.A LAC Client (a Host which runs L2TP natively) may also participatein tunneling to the Home LAN without use of a separate LAC. In thiscase, the Host containing the LAC Client software already has aconnection to the public Internet. A "virtual" PPP connection is then created and the local L2TP LAC Client software creates a tunnel tothe LNS. As in the above case, Addressing, Authentication,Authorization and Accounting will be provided by the Home LAN’sManagement Domain.Townsley, et al. Standards Track [Page 8]3.0 Protocol OverviewL2TP utilizes two types of messages, control messages and datamessages. Control messages are used in the establishment, maintenance and clearing of tunnels and calls. Data messages are used toencapsulate PPP frames being carried over the tunnel. Controlmessages utilize a reliable Control Channel within L2TP to guarantee delivery (see section 5.1 for details). Data messages are notretransmitted when packet loss occurs.+-------------------+| PPP Frames |+-------------------+ +-----------------------+| L2TP Data Messages| | L2TP Control Messages |+-------------------+ +-----------------------+| L2TP Data Channel | | L2TP Control Channel || (unreliable) | | (reliable) |+------------------------------------------------+| Packet Transport (UDP, FR, ATM, etc.) |+------------------------------------------------+Figure 3.0 L2TP Protocol StructureFigure 3.0 depicts the relationship of PPP frames and ControlMessages over the L2TP Control and Data Channels. PPP Frames arepassed over an unreliable Data Channel encapsulated first by an L2TP header and then a Packet Transport such as UDP, Frame Relay, ATM,etc. Control messages are sent over a reliable L2TP Control Channelwhich transmits packets in-band over the same Packet Transport.Sequence numbers are required to be present in all control messagesand are used to provide reliable delivery on the Control Channel.Data Messages may use sequence numbers to reorder packets and detect lost packets.All values are placed into their respective fields and sent innetwork order (high order octets first).3.1 L2TP Header FormatL2TP packets for the control channel and data channel share a common header format. In each case where a field is optional, its space does not exist in the message if the field is marked not present. Notethat while optional on data messages, the Length, Ns, and Nr fieldsmarked as optional below, are required to be present on all controlmessages.Townsley, et al. Standards Track [Page 9]This header is formatted:0 1 2 30 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+|T|L|x|x|S|x|O|P|x|x|x|x| Ver | Length (opt) |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| Tunnel ID | Session ID |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| Ns (opt) | Nr (opt) |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| Offset Size (opt) | Offset pad... (opt)+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+Figure 3.1 L2TP Message HeaderThe Type (T) bit indicates the type of message. It is set to 0 for a data message and 1 for a control message.If the Length (L) bit is 1, the Length field is present. This bitMUST be set to 1 for control messages.The x bits are reserved for future extensions. All reserved bits MUST be set to 0 on outgoing messages and ignored on incoming messages.If the Sequence (S) bit is set to 1 the Ns and Nr fields are present. The S bit MUST be set to 1 for control messages.If the Offset (O) bit is 1, the Offset Size field is present. The Obit MUST be set to 0 (zero) for control messages.If the Priority (P) bit is 1, this data message should receivepreferential treatment in its local queuing and transmission. LCPecho requests used as a keepalive for the link, for instance, should generally be sent with this bit set to 1. Without it, a temporaryinterval of local congestion could result in interference withkeepalive messages and unnecessary loss of the link. This feature is only for use with data messages. The P bit MUST be set to 0 for allcontrol messages.Ver MUST be 2, indicating the version of the L2TP data message header described in this document. The value 1 is reserved to permitdetection of L2F [RFC2341] packets should they arrive intermixed with L2TP packets. Packets received with an unknown Ver field MUST bediscarded.The Length field indicates the total length of the message in octets. Townsley, et al. Standards Track [Page 10]Tunnel ID indicates the identifier for the control connection. L2TPtunnels are named by identifiers that have local significance only.That is, the same tunnel will be given different Tunnel IDs by eachend of the tunnel. Tunnel ID in each message is that of the intended recipient, not the sender. Tunnel IDs are selected and exchanged asAssigned Tunnel ID AVPs during the creation of a tunnel.Session ID indicates the identifier for a session within a tunnel.L2TP sessions are named by identifiers that have local significanceonly. That is, the same session will be given different Session IDsby each end of the session. Session ID in each message is that of the intended recipient, not the sender. Session IDs are selected andexchanged as Assigned Session ID AVPs during the creation of asession.Ns indicates the sequence number for this data or control message,beginning at zero and incrementing by one (modulo 2**16) for eachmessage sent. See Section 5.8 and 5.4 for more information on usingthis field.Nr indicates the sequence number expected in the next control message to be received. Thus, Nr is set to the Ns of the last in-ordermessage received plus one (modulo 2**16). In data messages, Nr isreserved and, if present (as indicated by the S-bit), MUST be ignored upon receipt. See section 5.8 for more information on using thisfield in control messages.The Offset Size field, if present, specifies the number of octetspast the L2TP header at which the payload data is expected to start. Actual data within the offset padding is undefined. If the offsetfield is present, the L2TP header ends after the last octet of theoffset padding.3.2 Control Message TypesThe Message Type AVP (see section 4.4.1) defines the specific type of control message being sent. Recall from section 3.1 that this is only for control messages, that is, messages with the T-bit set to 1. Townsley, et al. Standards Track [Page 11]This document defines the following control message types (seeSection 6.1 through 6.14 for details on the construction and use ofeach message):Control Connection Management0 (reserved)1 (SCCRQ) Start-Control-Connection-Request2 (SCCRP) Start-Control-Connection-Reply3 (SCCCN) Start-Control-Connection-Connected4 (StopCCN) Stop-Control-Connection-Notification5 (reserved)6 (HELLO) HelloCall Management7 (OCRQ) Outgoing-Call-Request8 (OCRP) Outgoing-Call-Reply9 (OCCN) Outgoing-Call-Connected10 (ICRQ) Incoming-Call-Request11 (ICRP) Incoming-Call-Reply12 (ICCN) Incoming-Call-Connected13 (reserved)14 (CDN) Call-Disconnect-NotifyError Reporting15 (WEN) WAN-Error-NotifyPPP Session Control16 (SLI) Set-Link-Info4.0 Control Message Attribute Value PairsTo maximize extensibility while still permitting interoperability, a uniform method for encoding message types and bodies is usedthroughout L2TP. This encoding will be termed AVP (Attribute-ValuePair) in the remainder of this document.Townsley, et al. Standards Track [Page 12]4.1 AVP FormatEach AVP is encoded as:0 1 2 30 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+|M|H| rsvd | Length | Vendor ID |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| Attribute Type | Attribute Value...+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+[until Length is reached]... |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+The first six bits are a bit mask, describing the general attributes of the AVP.Two bits are defined in this document, the remaining are reserved for future extensions. Reserved bits MUST be set to 0. An AVP receivedwith a reserved bit set to 1 MUST be treated as an unrecognized AVP. Mandatory (M) bit: Controls the behavior required of animplementation which receives an AVP which it does not recognize. If the M bit is set on an unrecognized AVP within a message associatedwith a particular session, the session associated with this messageMUST be terminated. If the M bit is set on an unrecognized AVP within a message associated with the overall tunnel, the entire tunnel (and all sessions within) MUST be terminated. If the M bit is not set, an unrecognized AVP MUST be ignored. The control message must thencontinue to be processed as if the AVP had not been present.Hidden (H) bit: Identifies the hiding of data in the Attribute Value field of an AVP. This capability can be used to avoid the passing of sensitive data, such as user passwords, as cleartext in an AVP.Section 4.3 describes the procedure for performing AVP hiding.Length: Encodes the number of octets (including the Overall Lengthand bitmask fields) contained in this AVP. The Length may becalculated as 6 + the length of the Attribute Value field in octets. The field itself is 10 bits, permitting a maximum of 1023 octets ofdata in a single AVP. The minimum Length of an AVP is 6. If thelength is 6, then the Attribute Value field is absent.Vendor ID: The IANA assigned "SMI Network Management PrivateEnterprise Codes" [RFC1700] value. The value 0, corresponding toIETF adopted attribute values, is used for all AVPs defined withinthis document. Any vendor wishing to implement their own L2TPextensions can use their own Vendor ID along with private Attribute Townsley, et al. Standards Track [Page 13]values, guaranteeing that they will not collide with any othervendor’s extensions, nor with future IETF extensions. Note that there are 16 bits allocated for the Vendor ID, thus limiting this featureto the first 65,535 enterprises.Attribute Type: A 2 octet value with a unique interpretation acrossall AVPs defined under a given Vendor ID.Attribute Value: This is the actual value as indicated by the Vendor ID and Attribute Type. It follows immediately after the AttributeType field, and runs for the remaining octets indicated in the Length (i.e., Length minus 6 octets of header). This field is absent if the Length is 6.4.2 Mandatory AVPsReceipt of an unknown AVP that has the M-bit set is catastrophic tothe session or tunnel it is associated with. Thus, the M bit shouldonly be defined for AVPs which are absolutely crucial to properoperation of the session or tunnel. Further, in the case where theLAC or LNS receives an unknown AVP with the M-bit set and shuts down the session or tunnel accordingly, it is the full responsibility ofthe peer sending the Mandatory AVP to accept fault for causing annon-interoperable situation. Before defining an AVP with the M-bitset, particularly a vendor-specific AVP, be sure that this is theintended consequence.When an adequate alternative exists to use of the M-bit, it should be utilized. For example, rather than simply sending an AVP with the M- bit set to determine if a specific extension exists, availability may be identified by sending an AVP in a request message and expecting a corresponding AVP in a reply message.Use of the M-bit with new AVPs (those not defined in this document)MUST provide the ability to configure the associated feature off,such that the AVP is either not sent, or sent with the M-bit not set.4.3 Hiding of AVP Attribute ValuesThe H bit in the header of each AVP provides a mechanism to indicate to the receiving peer whether the contents of the AVP are hidden orpresent in cleartext. This feature can be used to hide sensitivecontrol message data such as user passwords or user IDs.The H bit MUST only be set if a shared secret exists between the LAC and LNS. The shared secret is the same secret that is used for tunnel authentication (see Section 5.1.1). If the H bit is set in any Townsley, et al. Standards Track [Page 14]AVP(s) in a given control message, a Random Vector AVP must also bepresent in the message and MUST precede the first AVP having an H bit of 1.Hiding an AVP value is done in several steps. The first step is totake the length and value fields of the original (cleartext) AVP and encode them into a Hidden AVP Subformat as follows:0 1 2 30 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| Length of Original Value | Original Attribute Value ...+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+... | Padding ...+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+Length of Original Attribute Value: This is length of the OriginalAttribute Value to be obscured in octets. This is necessary todetermine the original length of the Attribute Value which is lostwhen the additional Padding is added.Original Attribute Value: Attribute Value that is to be obscured.Padding: Random additional octets used to obscure length of theAttribute Value that is being hidden.To mask the size of the data being hidden, the resulting subformatMAY be padded as shown above. Padding does NOT alter the value placed in the Length of Original Attribute Value field, but does alter thelength of the resultant AVP that is being created. For example, If an Attribute Value to be hidden is 4 octets in length, the unhidden AVP length would be 10 octets (6 + Attribute Value length). After hiding, the length of the AVP will become 6 + Attribute Value length + sizeof the Length of Original Attribute Value field + Padding. Thus, ifPadding is 12 octets, the AVP length will be 6 + 4 + 2 + 12 = 24octets.Next, An MD5 hash is performed on the concatenation of:+ the 2 octet Attribute number of the AVP+ the shared secret+ an arbitrary length random vectorThe value of the random vector used in this hash is passed in thevalue field of a Random Vector AVP. This Random Vector AVP must beplaced in the message by the sender before any hidden AVPs. The same random vector may be used for more than one hidden AVP in the same Townsley, et al. Standards Track [Page 15]message. If a different random vector is used for the hiding ofsubsequent AVPs then a new Random Vector AVP must be placed in thecommand message before the first AVP to which it applies.The MD5 hash value is then XORed with the first 16 octet (or less)segment of the Hidden AVP Subformat and placed in the Attribute Value field of the Hidden AVP. If the Hidden AVP Subformat is less than 16 octets, the Subformat is transformed as if the Attribute Value field had been padded to 16 octets before the XOR, but only the actualoctets present in the Subformat are modified, and the length of theAVP is not altered.If the Subformat is longer than 16 octets, a second one-way MD5 hash is calculated over a stream of octets consisting of the shared secret followed by the result of the first XOR. That hash is XORed with the second 16 octet (or less) segment of the Subformat and placed in the corresponding octets of the Value field of the Hidden AVP.If necessary, this operation is repeated, with the shared secret used along with each XOR result to generate the next hash to XOR the next segment of the value with.The hiding method was adapted from RFC 2138 [RFC2138] which was taken from the "Mixing in the Plaintext" section in the book "NetworkSecurity" by Kaufman, Perlman and Speciner [KPS]. A detailedexplanation of the method follows:Call the shared secret S, the Random Vector RV, and the AttributeValue AV. Break the value field into 16-octet chunks p1, p2, etc.with the last one padded at the end with random data to a 16-octetboundary. Call the ciphertext blocks c(1), c(2), etc. We will also define intermediate values b1, b2, etc.b1 = MD5(AV + S + RV) c(1) = p1 xor b1b2 = MD5(S + c(1)) c(2) = p2 xor b2. .. .. .bi = MD5(S + c(i-1)) c(i) = pi xor biThe String will contain c(1)+c(2)+...+c(i) where + denotesconcatenation.On receipt, the random vector is taken from the last Random VectorAVP encountered in the message prior to the AVP to be unhidden. The above process is then reversed to yield the original value.Townsley, et al. Standards Track [Page 16]。
IPSec故障排除了解和使用调试指令

IPSec故障排除:了解和使用调试指令ContentsIntroductionPrerequisitesRequirementsComponents UsedConventionsCisco IOS软件调试show crypto isakmp sashow crypto ipsec sashow crypto engine connection activedebug crypto isakmpdebug crypto ipsec示例错误信息Replay Check FailedQM FSM 错误无效本地地址IKE信息从X.X.X.X失败了其健全性检查或是畸形的Processing of Main Mode Failed with PeerProxy Identities Not SupportedTransform Proposal Not SupportedNo Cert and No Keys with Remote Peer没找到的对等体地址X.X.X.XIPsec Packet has Invalid SPIIPSEC(initialize_sas):Invalid Proxy IDs被保留的没有零在有效载荷5Hash Algorithm Offered does not Match PolicyHMAC Verification FailedRemote Peer Not Responding所有SA IPSec建议认为不可接受Packet Encryption/Decryption Error信息包接收错误由于ESP顺序失败设法的错误设立在7600系列路由器的VPN隧道PIX调试show crypto isakmp sashow crypto ipsec sadebug crypto isakmpdebug crypto ipsec常见路由器-VPN客户端问题无法访问 VPN 隧道外部的子网:分割隧道常见PIX-to-VPN客户端问题建立隧道之后流量不流通:无法 ping 通位于 PIX 后的网络内部建立隧道之后,用户无法浏览 Internet:分割隧道建立隧道之后,某些应用程序无法正常工作:对客户端进行 MTU 调节无法使用 sysopt 命令验证访问控制列表 (ACL)Related InformationIntroduction本文描述用于的普通的调试指令排除在两Cisco IOS的IPsec问题故障?软件和PIX/ASA。
罗克韦尔(AB)以太网通讯模块的重置与地址冲突检测详解

罗克韦尔(AB)以太网通讯模块的重置与地址冲突检测详解将模块IP 地址重置为出厂默认值可使用以下方法将模块IP 地址重置为出厂默认值:•如果模块设有旋转开关,将开关设置为888,然后循环上电。
•如果模块没有旋转开关,则使用MSG 指令重置IP 地址,具体操作查看msg 指令使用说明。
IP 地址冲突检测一些EtherNet/IP 通信模块支持IP 地址冲突检测。
当执行以下任务时,模块将确认其IP 地址是否与任何其他网络设备的IP 地址都不重复:•将模块连接到EtherNet/IP 网络。
•更改模块的IP 地址。
如果模块的IP 地址与网络中的另一个设备相同,则模块的EtherNet/IP端口将变为冲突模式。
在冲突模式下,将出现以下情况:•OK 状态指示灯呈红色闪烁。
•网络(NET) 状态指示灯呈红色常亮。
•一些EtherNet/IP 通信模块的模块状态显示屏将指示冲突。
显示屏滚动显示:OK < 该模块的IP 地址> Duplicate IP < 检测到重复节点的Mac 地址>例如:OK 10.88.60.196 Duplicate IP - 00:00:BC:02:34:B4•一些EtherNet/IP 通信模块的诊断网页将显示IP 地址冲突检测信息。
IP 地址冲突的解决方法情况一:•两个模块均支持IP 地址冲突检测•当一个模块在网络上运行之后,另一个模块被添加到该网络中解决:1. 先开始运行的模块占用IP 地址并继续不间断地运行。
2. 后开始运行的模块检测到地址冲突并进入冲突模式。
要给模块分配新的IP 地址并离开冲突模式。
情况二:•两个模块均支持IP 地址冲突检测•两个模块差不多同时上电解决:两个EtherNet/IP 设备均进入冲突模式。
要解决此类冲突,请按以下步骤操作:a.为其中一个模块分配新的IP 地址。
b. 对另一个模块循环上电。
情况三:一个模块支持IP 地址冲突检测,但另一个不支持解决:1. 不管哪个模块先获取IP 地址,后者( 即不支持IP 地址冲突检测的模块) 将占用IP 地址并继续不间断地运行。
使用 MCAL4.3 中的 CSE (加密服务引擎) 模块 - NXP Semiconductors

Using the CSE (Cryptographic Services Engine) Module in MCAL4.3by: NXP Semiconductors1 IntroductionToday, people are concerned about sharing/transmittinginformation in a secure and trusted manner betweenparties in the automotive area. The security functionsimplemented with Cryptographic Services Engine(CSE)module are described in the Secure HardwareExtension(SHE) functional specification.This application note provides an introduction to theCSE module on the MPC5777C and explains how toconfigure and use this module in MCAL4.3. Afterreading this application note, you should be able to:• Understand the CSE configuration process inMCAL4.3• Understand how CSE module working on theMPC5777CThe application note also provides examples for specificconfigurations. The examples are provided in thesoftware package accompanying this document and isalso explained in detail. To aid in understanding of thisdocument and software package, you need to downloadthe MPC5777C reference manual from the NXPwebsite. The following table shows the abbreviationsused throughout the document.NXP SemiconductorsDocument Number: AN 13061 Application Notes Rev. 0 , 12/2020 Contents 1 Introduction ............................................................................ 1 3 CSE module on MPC5777C device ....................................... 2 3.1 Chip-specific CSE information ............................... 2 3.2 Main features .......................................................... 2 3.3 Modes of operation ................................................. 3 3.4 Block diagram ......................................................... 3 4 AES-128 encryption and decryption overview ....................... 5 4.1 Electronic Codebook (ECB) ................................... 5 4.2 Chiper-block chaining (CBC) ................................. 5 4.3 CMAC (Cipherbased Message Authentication Code) 6 5 CRYPTO module in MCAL4.3 ......................................... 7 6 CRYPTO loading key and processing primitive .............. 11 7 References . (12)2 CSE module on MPC5777CTable 1. Abbreviations and acronyms2 CSE module on MPC5777CThe Cryptographic Services Engine (CSE) is a peripheral module that implements the security functions described in the Secure Hardware Extension (SHE) Functional Specification Version 1.1.The CSE design includes a host interface with a set of memory mapped registers and a system bus interface. The host interface are used by the CPU to issue commands. The system bus interface allows the CSE to access system memory directly. Two dedicated blocks of system flash memory are used by the CSE for secure key storage.2.1 Chip-specific CSE informationThis chip has one instance of the CSE module. The module:•Executes the chip's secure boot process. See the System Boot details in the MPC5777C Reference Manual.•Exclusive access to the flash memory blocks mapped to the C55FMC_LOCK1 register, PASS_LOCK1_PGn registers, and TDRn_LOCK1 DCF client. See C55FMC_LOCK1 register bit mapping. The system MPU is automatically configured to prevent other bus masters frominterfering with CSE's access to the flash memory.2.2 FeaturesThe CSE has the following features:•Secure storage for cryptographic keys•AES-128 encryption and decryption•AES-128 CMAC authentication•True random number generation•Secure boot mode•System bus master interface2.3 Modes of operationThe CSE supports operation in Normal and Debug modes of operation. The use of the cryptographic keys stored by the CSE is controlled based on the activation of the CPU debug port and the successful completion of the secure boot process.The CSE has a low-power mode that disables the clock to all logic except the host interface. Register accesses are supported in this mode, but commands are not processed.2.4 Block diagramThe CSE design includes a command processor, host interface, system bus interface, local memory, AES logic, and True Random Number Generator (TRNG) as shown below.A host interface (via the peripheral bridge) with a set of memory mapped registers that are used by the CPU to issue commands. Furthermore, a system bus interface (via the crossbar interface) allows the CSE to directly access system memory. Here the crypto module behaves like any other master on the Crossbar switch (XBAR). Through the host interface, you can configure and control the CSE module, like putting the module into low power mode, enabling interrupts for finished command processing, or suspending command processing. A status and error register gives further system information. For a complete list of CSE commands see MPC5777C reference manual.Two dedicated blocks of system flash memory are used by the CSE for secure key and firmware storage. These blocks are not accessible by other masters from the system. Therefore, they are called secure flash. The command processing is done by a 32-bit CSE core with attached ROM and RAM running at system frequency. After system boot, the core comes out of reset and executes boot code from the module ROM. This code will load the firmware from the secure flash into the module RAM and start executing from there. This reduces the flash accesses by the crypto core on the Crossbar. The AES block is a slave to the crypto internal bus. It processes the encryption (plaintext → ciphertext) and decryption (ciphertext → plaintext) and offers AES CMAC authentication. This application note deals only with the authentication capabilities of the CSE.2 CSE module on MPC5777CFigure 1. CSE block diagram on MPC5777C3 AES-128 encryption and decryption overviewBlock ciphers like the AES algorithm, working with a defined granularity, are often 64 bits or 128 bits. The simplest way to encode data is to split the message in the cipher specific granularity. In this case, the cipher output depends only on the key and input value. The drawback of this cipher mode, which is called Electronic Code Book (ECB), is that the same input values will be decoded into the same output values. This gives attackers the opportunity to use statistical analysis (for example, in a normal text some letter combinations occur much more often than others).To overcome this issue other cipher modes were developed like the Cipher-block chaining (CBC), Cipher feedback (CFB), Output feedback (OFB) and Counter (CTR) mode.The CSE module supports only the ECB and the CBC mode which are described in the following sections.3.1 Electronic Codebook (ECB)Each block has no relationship with another block of the same message or information. The following figure shows the block diagram of the ECB mode.Figure 2. ECB block diagramThe following figure shows the drawback of the ECB mode. Taking the Freescale logo as an example it is still visible in the encoded form using this mode. It is obvious that this is not very secure.Figure 3. Encoding using ECB mode3.2 Cipher-block chaining (CBC)The Cipher-block (CBC) mode, invented in 1976, is one of the most important cipher modes. In this mode the output of the last encoding step is xor’ed with the input block of the actual encoding step. Because of this, an additional value for the first encoding step is necessary which is called initialization vector (IV). Using this method each cipher block depends on the plaintext blocks processed up to that point.3 AES-128 encryption and decryption overviewThe following figure shows the block diagram of the CBC mode.Figure 4. CBC block diagramThe following figure shows the encoding result of the Freescale logo using the CBC cipher mode. The difference from the ECB mode is self-evident. In many applications ECB mode may not be appropriate.Figure 5. Encoding using CBC mode3.3 CMAC (Cipher-based Message Authentication Code)A CMAC provides a method for authenticating messages and data. The CMAC algorithm accepts as input a secret key and an arbitrary-length message to be authenticated, and outputs a CMAC. The CMAC value protects both a message's data integrity as well as its authenticity, by allowing verifiers (who also possess the secret key) to detect any change in the message contentFigure 6. CMAC SchemeIf you want more information about CSE functional description and CSE commands, see MPC5777C reference manual.CRYPTO module in MCAL4.34 CRYPTO module in MCAL4.3The following figure shows the location of Crypto Driver module in the micro controller abstraction layer. It is below the Crypto Interface module and Crypto Service Manager module. It implements a generic interface for synchronous and asynchronous cryptographic primitives. It also supports key storage, key configuration, and key management for cryptographic services.To provide cryptographic functionalities an ECU needs to integrate one unique Crypto Service Manager module and one Crypto Interface. However, the Crypto interface can access several Crypto Drivers, each of them is configured according to the underlying Crypto Driver Object.Figure 7. AUTOSAR layered view with crypto moduleA Crypto Driver Object represents an instance of independent crypto hardware “device” (e.g. AES accelerator). There could be a channel for fast AES and CMAC calculations on a HSM for jobs with high priority, which ends on a native AES calculation service in the Crypto Driver. But it is also possible that a Crypto Driver Object is a piece of software, e.g. for RSA calculations where jobs are able to encrypt, decrypt, sign or verify. The Crypto Driver Object is the endpoint of a crypto channel.NOTECrypto have layers including Crypto Cryif and CSM, since CSM is alwaysa stub and only in order to avoid compiler error. Thejob_configuration_structure is responsible by CSM, so the job structurecannot generated by NXP CSM itself, as CSM is a stub in MCALperspective. Developers need to manually update the structure and passingit to Crypto_Process_Job. So if need more CSM package support andshould contact the third party(i.e vector DaVinci).CRYPTO module in MCAL4.3Figure 8 shows the relationship between different configuration items in EB:Cryptoprimitives ->CryptoDriverObject->CryIfChannel->CsmQueue->CsmJobs CryptokeyElement->CryptokeyType->Cryptokey->CryIfKey->CsmKeysCrypto Driver Object: A Crypto Driver implements one or more Crypto Driver Objects. The Crypto Driver Object can offer different crypto primitives in hardware or software. The Crypto Driver Objects of one Crypto Driver are independent of each other. There is only one workspace for each Crypto Driver Object (i.e. only one crypto primitive can be performed at the same time)CryptoKeyElement: Key elements are used to store data. This data can be key material or the IV needed for AES encryption. It can also be used to configure the behavior of the key management functions.CryptoKeyType: A key type consists of references to key elements. The key types are typically pre-configured by the vendor of the Crypto Driver.CryptoKey: A Key can be referenced by a job in the CSM. In the Crypto Driver, the key references a specific key type.CryptoPrimitive: A crypto primitive is an instance of a configured cryptographic algorithm realized in a Crypto Driver Object.Figure 8. Crypto configuration in EBCRYPTO module in MCAL4.3 CryIf: The crypto drivers are called by CryIf, the Crypto drivers access the underlying hardware and software objects to calculate results with their cryptographic primitives. The results are forwarded to CryIf.CsmJob: A job is an instance of a job’s configured in cryptographic primitive. An operation of a crypto primitive declares what part of the crypto primitive will be performed. There are three different operation modes:•START is a operation mode indicates a new request of a crypto primitive and will be cancel all previous request of the same job and preemptive•UPDATE mode indicates that the crypto primitive expects input data•FINISH mode indicates that after this part all data are fed completely and the crypto primitive can finalize the calculationThe priority of a job defines the importance of it. The higher the priority means more immediately the job is executed. The priority of a cryptographic job is part of the configuration.Figure 9. Cryif and CsmJobs in EBNOTEThe crypro driver does not have callback function in CryIf.c file, so itshould add SampleAppCrypto(job, result) intoCryIf_CallbackNotification(const Crypto_JobType* job, Std_ReturnTyperesult) function in CryIf.c file.CRYPTO module in MCAL4.3As show in the following figure, this sample configure three primitives, ENCRYPT, RNG(random number generated) and DECRYPT.Figure 10. CryptoPrimitive configuration in EBAs show in the following figure, A CryptoKeyElement having the CryptoKeyElementId set to 1 represents a key material and cannot be set be using the field CryptoKeyElementInitValue. All the other CryptoKeyElementIds can be set either using CryptoKeyElementSet function or the Tresos field CryptoKeyElementInitValue.Figure 11. CryptoKeyEelment configuration in EBAs show in the following figure, key elements and keys have to be configured for all primitives supported in this release. Containers CryptoKeyElements, CryptoKeyTypes and CryptoKeys should be activated or deactivated in Tresos in the same time. For a key it is mandatory to have a key type and configured key elements. The index of the different key elements from the different Crypto services are defined as in imported types table SWS_Csm_01022(in AUOTOSAR document Specification of Crypto Service Manager)A key has a state which is either 'valid' or 'invalid'. By default, all the keys are 'invalid' and have to be set to valid by using the function Crypto_KeySetValid. If a key is in the invalid state then the Crypto services which make use of the key returns CRYPTO_E_KEY_NOT_VALID value.Figure 12. CryptoKey configuration in EBCRYPTO loading key and processing primitive Because crypto driver not include CSM layer, so the Crypto_JobType structure should be initialized manually in the code.Figure 13. Csm in EB5 CRYPTO loading key and processing primitiveTo process a primitive (random number generation, MAC generation or verification, AESencrypt/decrypt), the following sequence should be followed:1.If keys are needed, the containers CryptoKeyElements, CryptoKeyTypes, CryptoKeys should beenabled2.Crypto_KeyElementSet(65536, CryptoKeyElementId_0, aes_test01_key, 16) meaning a keymaterial corresponding to key 65536 and having the size 16 bytes is configured3.Call the API function Crypto_KeySetValid(65536) to enable key 655364.Call the API function Crypto_ProcessJob() to process job, it process three jobs(randomgenerated, encryption and decryption) in this sample codeFigure 14. Process job in sample code6 ReferencesCall API function StringCompare ((uint8_t*)ucPlainText, ucDecText, 16) to verify the encryption and decryption functionality.Figure 15. Compare the ucPlainText and ucDecText6 References•MPC5777C Reference Manual (Document ID: MPC5777CPRM)•Specification of Crypto Service Manager(Document link)•Specification of Crypto Driver(Document link)•AUTOSAR_MCAL_CRYPTO_IM•AUTOSAR_MCAL_CRYPTO_UMDocument Number: AN 13061 Rev. 0 12/2020 How to Reach Us: Home Page: Web Support: /supportInformation in this document is provided solely to enable system and software implementers to use NXP products. There are no express or implied copyright licenses granted hereunder to design or fabricate any integrated circuits based on the information in this document. NXP reserves the right to make changes without further notice to any products herein. NXP makes no warranty, representation, or guarantee regarding the suitability of its products for any particular purpose, nor does NXP assume any liability arising out of the application or use of any product or circuit, and specifically disclaims any and all liability, including without limitation consequential or incidental damages. “Typical ” parameters that may be provided in NXP data sheets and/or specifications can and do vary in different applications, and actual performance may vary over time. All operating parameters, including “typicals,” must be validated for each customer application by customer's technical experts. NXP does not convey any license under its patent rights nor the rights of others. NXP sells products pursuant to standard terms and conditions of sale, which can be found at the following address:/SalesTermsandConditions . While NXP has implemented advanced security features, all products may be subject to unidentified vulnerabilities. Customers are responsible for the design and operation of their applications and products to reduce the effect of these vulnerabilities on customer’s applications and products, and NXP accepts no li ability for any vulnerability that is discovered. Customers should implement appropriate design and operating safeguards to minimize the risks associated with their applications and products. NXP, the NXP logo, NXP SECURE CONNECTIONS FOR A SMARTER WORLD, COOLFLUX, EMBRACE, GREENCHIP, HITAG, I2C BUS, ICODE, JCOP, LIFE VIBES, MIFARE, MIFARE CLASSIC, MIFARE DESFire, MIFARE PLUS, MIFARE FLEX, MANTIS, MIFARE ULTRALIGHT, MIFARE4MOBILE, MIGLO, NTAG, ROADLINK, SMARTLX, SMARTMX, STARPLUG, TOPFET, TRENCHMOS, UCODE, Freescale, the Freescale logo, AltiVec, C 5, CodeTEST, CodeWarrior, ColdFire, ColdFire+, C Ware, the Energy Efficient Solutions logo, Kinetis, Layerscape, MagniV, mobileGT, PEG, PowerQUICC, Processor Expert, QorIQ, QorIQ Qonverge, Ready Play, SafeAssure, the SafeAssure logo, StarCore, Symphony, VortiQa, Vybrid, Airfast, BeeKit, BeeStack, CoreNet, Flexis, MXC, Platform in a Package, QUICC Engine, SMARTMOS, Tower, TurboLink, and UMEMS are trademarks of NXP B.V. All other product or service names are the property of their respective owners. Arm, AMBA, Arm Powered, Artisan, Cortex, Jazelle, Keil, SecurCore, Thumb, TrustZone, and μVision are registered trademarks of Arm Limited (or its subsidiaries) in the EU and/or elsewhere. Arm7, Arm9, Arm11, big.LITTLE, CoreLink, CoreSight, DesignStart, Mali, Mbed, NEON, POP, Sensinode, Socrates, ULINK and Versatile are trademarks of Arm Limited (or its subsidiaries) in the EU and/or elsewhere. All rights reserved. Oracle and Java are registered trademarks of Oracle and/or its affiliates. The Power Architecture and word marks and the Power and logos and related marks are trademarks and service marks licensed by . © 2020 NXP B.V.。
林金第七届学术年会个人简介和摘要

Jin Lin (林金)Short Biography:Born on October 29, 1986 in Guizhou province. Now, Chen is a PhDstudent of Department of Modern Physics, University of Science and Technology of China. He received B.S. degree in computer sciencefrom University of Jinan. He joined Pan’s group of the HeFei NationalLaboratory for Physical Sciences at the Microscle in 2011. Hisresearch interests are focused on the electronic control of the quantum communication and superconducting quantum computing.Talk: Space-to-Ground Quantum Key Distribution Using a Small-Sized Payload on Tiangong-2 Space LabAbstract:Quantum technology establishes a foundation for secure communication via quantum key distribution (QKD). In the last two decades, the rapid development of QKD makes a global quantum communication network feasible. In order to construct this network, it is economical to consider small-sized and low-cost QKD payloads, which can be assembled on satellites with different sizes, such as space stations. Here we report an experimental demonstration of space-to-ground QKD using a small-sized payload, from Tiangong-2 space lab to Nanshan ground station. The 57.9-kg payload integrates a tracking system, a QKD transmitter along with modules for synchronization, and a laser communication transmitter. In the space lab, a 50MHz vacuum+weak decoy-state optical source is sent through a reflective telescope with an aperture of 200mm. On the ground station, a telescope with an aperture of 1200mm collects the signal photons. A stable and high-transmittance communication channel is set up with a high-precision bidirectional tracking system, a polarization compensation module, and a synchronization system. When the quantum link is successfully established, we obtain a key rate over 100bps with a communication distance up to 719km. Together with our recent development of QKD in daylight, the present demonstration paves the way towards a practical satellite-constellation-based global quantum secure network with small-sized QKD payloads.(请各位同学根据自己情况修改个人简历,并替换照片,请勿修改字体和字号,谢谢配合!)。
ebpf 环境准备 -回复

ebpf 环境准备-回复EBPF环境准备EBPF(Extended Berkeley Packet Filter)是一种内核扩展技术,它允许开发人员在内核中注入小型的程序以实现高效的包处理和网络分析。
EBPF 已经成为在现代操作系统中进行网络和系统跟踪的重要工具,因其高性能和安全性而受到广泛关注。
本文将向您介绍如何准备EBPF环境并开始使用它。
步骤一:安装所需工具和库在开始之前,我们需要安装一些必要的工具和库。
首先,我们需要安装LLVM和Clang,它们是EBPF编译器和工具链的一部分。
我们可以使用包管理器来安装它们,例如在Ubuntu上,我们可以运行以下命令:sudo apt-get install llvm clang接下来,我们需要安装libbpf库,它是EBPF的运行时库。
您可以从GitHub 上的libbpf存储库中获取它,并按照其文档中的说明进行安装。
例如,您可以运行以下命令:git clonecd libbpfmakesudo make install步骤二:编写和编译EBPF程序一旦我们安装了所需的工具和库,我们就可以开始编写和编译我们的第一个EBPF程序了。
EBPF程序可以使用C语言编写,因此我们可以使用任何支持C语言的文本编辑器来编写它。
在本例中,我们将创建一个简单的EBPF程序来统计收到的数据包数量。
首先,我们需要创建一个名为`packet_counter.c`的文件,并在其中编写以下代码:c#include <linux/bpf.h>SEC("socket")int packet_counter(struct __sk_buff *skb){int key = 0;__u64 *value;value = bpf_map_lookup_elem(&packet_map, &key);if (value)*value += 1;return XDP_PASS;}在这个简单的EBPF程序中,我们首先定义了一个名为`packet_counter`的函数,它接收一个名为`skb`的数据包作为参数。
- 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。
Simple protocol for secure decoy-state quantum key distribution with a loosely controlled sourceXiang-Bin Wang a͒Department of Physics,Tsinghua University,Beijing100084,ChinaCheng-Zhi Peng b͒Department of Physics,Tsinghua University,Beijing100084,China;Hefei National Laboratory forPhysical Sciences at Microscale,University of Science and Technology of China,Hefei,Anhui230026,China;and Department of Modern Physics,University of Science and Technology of China,Hefei,Anhui230026,ChinaJian-Wei Pan c͒Department of Physics,Tsinghua University,Beijing100084,China;Hefei National Laboratory forPhysical Sciences at Microscale,University of Science and Technology of China,Hefei,Anhui230026,China;and Department of Modern Physics,University of Science and Technology of China,Hefei,Anhui230026,China;and Physikalisches Institut,Universität Heidelberg,Philosophenweg12,69120Heidelberg,Germany͑Received3October2006;accepted10December2006;published online18January2007͒The method of decoy-state quantum key distribution requests different intensities of light pulses.Existing theory has assumed exact control of intensities.Here the authors propose a simple protocol which is secure and efficient even there are errors in intensity control.In their protocol,decoy pulses and signal pulses are generated from the same father pulses with a two-value attenuation.Given the upper bound offluctuation of the father pulses,their protocol is secure provided that the two-value attenuation is done exactly.They propose to use unbalanced beam splitters for a stable attenuation.©2007American Institute of Physics.͓DOI:10.1063/1.2431718͔Recently,some methods1–9have been proposed for se-cure quantum key distribution10–12͑QKD͒with coherent states.13–15One of these methods is the so-called decoy-state method1–6where Alice randomly changes the intensity of her pulses among a few values͑e.g.,three values:0,,andЈ͒or infinite values and then she can verify the fraction of single-photon counts in the raw key.With this information,a securefinal key can be distilled by using the separate theo-retical results.16So far a number of experiments on decoy-state QKD have been done17–21in opticalfiber or in free space,in po-larization space,or with phase coding.However,the existing theory of decoy-state method assumes the exact control of pulse intensities.A problem met in practice is how to carry out the decoy-state method efficiently given the inexact con-trol of pulse intensity.As we have shown22actually one can verify the single-photon counts rather efficiently with simple tomography even though the intensityfluctuations of each light pulses are large.However,doing it in that way Alice needs additional operation of tomography.Here we present a simpler protocol for decoy-state method QKD.Here we shall consider the effects of inexact control ofandЈin a decoy-state protocol requesting three intensities ͕0,,Ј͖.͑Actually,all decoy-state protocols with a few in-tensities,e.g.,two or four intensities3,5have the same basic problem of inexact control ofandЈ.͒For clarity,lets us first consider an ideal protocol with exact intensity control, as shown in Fig.1͑a͒.At any time t,if Alice wants to send a pulse of intensityorЈ,shefirst produces a father pulse of intensity⍀.After that she attenuates the pulse by A͑t͒=/⍀or A͑t͒=Ј/⍀randomly and a pulse of intensityor Јis produced randomly and sent out to Bob.In this idealprotocol,both⍀and A͑t͒are controlled exactly.For practical use,we propose a similar protocol as shown in Fig.1͑b͒.Alice wants to produce an intensity⍀for the father pulse.She then takes the same random attenua-tions as that in the ideal protocol.Here we assume that Alice can control the attenuation factors of A͑t͒exactly͑either /⍀orЈ/⍀͒but she cannot control⍀exactly.͓To control the instantaneous attenuation A͑t͒exactly we can use unbal-anced beam splitters as we are going to show.͔At each time, she has actually produced intensities of͕⍀t͖for the father pulses.Although we can never control the intensity exactly,a͒Electronic mail:xbwang@ b͒Electronic mail:pcz@c͒Electronic mail:jian-wei.pan@physi.uni-heidelberg.de FIG.1.͑a͒Ideal protocol that Alice can produce constant intensity⍀for the father pulse;therefore intensitiesandЈare controlled exactly.͑b͒Real protocol used in practice.At each time,Alice wants to produce intensity⍀for the father pulse,however,she actually produces͕⍀t͖at each time t. Consequently,the intensities of output pulses are͕i͖and͕iЈ͖.We assumethat Alice can control the attenuator A͑t͒exactly in a real protocol.After a father pulse is produced,Alice randomly choose the attenuation factor by A͑t͒=/⍀or A͑t͒=Ј/⍀.Here the subscript t is from1to N+NЈ,subscript i for͕i͖is from1to N,and subscript i for͕iЈ͖is from1to NЈ.APPLIED PHYSICS LETTERS90,031110͑2007͒0003-6951/2007/90͑3͒/031110/3/$23.00©2007American Institute of Physics90,031110-1Downloaded 23 Sep 2009 to 210.45.72.58. Redistribution subject to AIP license or copyright; see /apl/copyright.jspby our currently existing technology,we can definitely con-trol the intensity in a small range,say,e.g.,controlling the fluctuation within ±5%of ⍀.That is to say,Alice knows the upper bound of ͕⍀t ͖.We denote such an upper bound value as ⍀M .Given this upper-bound value ⍀M ,the setup in Fig.1͑b ͒is equivalent to a virtual setup as shown in Fig.2͑a ͒.In the virtual protocol shown in Fig.2͑a ͒,every time a father pulse of constant intensity ⍀M is first produced and then the pulse is attenuated randomly,with attenuation factors of A Ј͑t ͒=⍀t /⍀M .Alice cannot control this A Ј͑t ͒.After this attenua-tion,a pulse of intensity ⍀t is produced.Note that A Ј͑t ͒is independent of and Ј,since we can imagine that Alice decides to use or Јafter the attenuation A Ј͑t ͒.Since all attenuators are inside Alice’s laboratory,it makes no differ-ence if Alice exchanges the order of attenuators A ͑t ͒and A Ј͑t ͒.The physical meaning of order exchange is that Alice first decides to use or Јand then arrange the attenuation A Ј͑t ͒which is independent of Alice’s decision of using or Ј.This is just the virtual protocol in Fig.2͑b ͒.In Fig.2͑b ͒,after the pulse passes A ͑t ͒but before passes A Ј͑t ͒,the inten-sity should be either ˜=͑/⍀͒⍀M or ˜Ј=͑Ј/⍀͒⍀M ex-actly .That is to say,during the virtual stage between A ͑t ͒and A Ј͑t ͒,the light intensities of each pulses are either ex-actly ˜or exactly ˜Ј.But after a pulse passes through A Ј͑t ͒,the intensity is changed to inexact values of i or i Ј.For the security proof of the real setup in Fig.1͑b ͒,we show the following lemma first.Lemma .The setup in Fig.2͑b ͒is unconditionally secure if Alice regards it as a three-intensity decoy-state protocol with each light intensities being randomly chosen from ͕0,˜,˜Ј͖.Proof .First we suppose Eve controls A Ј͑t ͒.The dashed square can be regarded as an exact source for a decoy-stateprotocol using intensities 0,˜,and ˜Ј.As it has been known already,decoy-state method with exact intensity control is secure given whatever channel.Here what Eve can do is first using A Ј͑t ͒for attenuation and then do whatever.This is only a type of specific channel therefore cannot be used to cheat Alice and Bob.In the setup of Fig.2͑b ͒,actually the attenu-ator A Ј͑t ͒is not controlled by Eve,definitely the setup issecure because Eve cannot attack the protocol better with her power being reduced.Alternatively,we imagine that A Ј͑t ͒is controlled by Alice’s friend,Clare.If Alice choose to disre-gard Clare’s existence then to Alice this is just a decoy-stateprotocol with exactly controlled intensities of ˜and ˜Ј.Given this lemma,we immediately have the following theorem.Theorem.The setup shown in Fig.1(b)is uncondition-ally secure even though there are intensity fluctuations in values and Јif (1)the values of ͕⍀t ͖are upper bounded by ⍀M ,͑2͒attenuation A ͑t ͒is exactly controlled,and (3)Alice assumes that she had used exact intensities of ͕0,͑⍀M /⍀͒,Ј͑⍀M /⍀͖͒in calculating the fraction of single-photon counts and distilling the final key .The proof is simply that the final light pulses produced in Fig.1͑b ͒and final light pulses produced in Fig.2͑b ͒are identical.While the scheme in Fig.2͑b ͒has been proven to be secure by our Lemma.The question remaining is then how to make stable at-tenuations A ͑t ͒used above.We can realize A ͑t ͒by beam splitters as shown in Fig.3.First,we attenuate each father pulses ͑⍀t ͒by a fixed attenuation factor of A 0=͑+Ј͒/⍀.͑A 0can be realized by an unbalanced beamsplitter.͒Second,after this A 0attenuation,we split the beam by a :Јbeam splitter and then either the transmitted beam b or the re-flected beam b Јwill be blocked and the other one will be guided to the optical fiber and sent to Bob.Suppose the ideal protocol with parameters e and e Јwould produce a good key rate in a certain experimental condition.Alice can try to use any intensities around e and e Јand then assumes that she had used larger intensities for security.One good choice is that Alice tries to produce ͕0,e /,e Ј/͖with =⍀M /⍀for quantum communication with Bob and then assumes to have used ͕0,e ,e Ј͖.For simplicity,we shall only consider this option hereafter.The actual efficiency of the protocol can be concluded by a real experiment.But we can still roughly estimate the efficiency theoretically on what should be found if we did the experiment.One can calculate the final key rate 5,16if he knows fraction of single-photon counts and the quantum bit error rate ͑QBER ͒.We consider the normal case where there is no Eve.and the channel transmittance is linear.We shall first compare the key rate of the following two protocols:our protocol with channel transmittance ͓protocol P ͔͑͒and the ideal proto-col with channel transmittance /͓protocol P 0͑/͔͒.In both protocols they will assume exact values 0,e ,and e Јin the calculation of single-photon counts and final key distilla-tion.However,in protocol P ͑͒,Alice had done her best to produce 0,e /,e Ј/for quantum communication.In both protocols,Alice and Bob can find the valuesofFIG.2.Equivalent virtual protocols.Our real protocol in Fig.1͑b ͒is equiva-lent to a virtual protocol as shown in part ͑a ͒of this figure.Here Alice first produces a constant intensity ⍀M for each father pulses and then attenuates each of them by attenuator A Ј͑t ͒.After A Ј͑t ͒,the pulse intensity is ⍀t .It makes no difference to the output light if we exchange the order of A ͑t ͒and A Ј͑t ͒;therefore ͑a ͒is equivalent to ͑b ͒.In part ͑b ͒,we can also regard the dashed square as our source and A Ј͑t ͒as part of thechannel.FIG.3.Realizing A ͑t ͒by unbalanced beam splitters.A 0:a constant attenu-ator with attenuation factor ͑+Ј͒/⍀,this can be realized by an unbal-anced beam splitter.BS:a :Јbeam splitter.OS:optical switcher.OF:optical fiber.Downloaded 23 Sep 2009 to 210.45.72.58. Redistribution subject to AIP license or copyright; see /apl/copyright.jspSe =1−e−e/+d B and SeЈ=1−e−eЈ/+dBas the countingrate͑yields͒of pulses of intensities͑or assumed intensities͒ofe andeЈ,respectively,where d B is the dark count rate of Bob’s detector.We have the following joint equations2to calculate the single-photon transmittance for both protocols,e−e s0+e e−e s1+cs c=Se,e−eЈs0Ј+eЈe−eЈs1Ј+ͩeЈeͪ2ee−eЈs cЈഛSeЈ.͑1͒Here c=1−e−e−e e−e.Parameters of s x are counting rates for states͉x͗͘x͉from x pulses͑x=0,1͒,s c is the counting rate of statec͑state of those multiphoton pulses͒frome pulses. Parameters s xЈare counting rates of the same state as defined for s x,but they are for those states fromeЈpulses only.The values of s0and s0Јcan be deduced from the observed count-ing rate of those vacuum pulses.͑For the two-intensity protocol,5one can assume s0=s0Ј=0for the minimum key rate.͒Asymptotically,s x=s xЈand s c=s cЈ.Given afinite num-ber of pulses,s x and s xЈcan be a bit different but the possible range of difference can be bounded by classical statistics2,3,5 with exponential certainty therefore minimum values of s1 and s1Јcan be calculated numerically.Since s1and s1Јvalues for both protocols are calculated from the same equations with same parameters,the value of verified single-photon transmittance͑s1,s1Ј͒of our protocol P͑͒is equal to that of the ideal protocol P0͑/͒.This indicates that the two pro-tocols should have the same fraction of single-photon counts for each intensity.If the QBER is determined by dark counts,alignment error and transmission error,the value in our protocol should be the same with͑or a bit less than͒that of the ideal protocol P0͑/͒.Given all these values requested for thefinal key distil-lation are the same for the two protocols,we conclude that that the key rate of our protocol P͑͒is the same with that of the ideal protocol P0͑/͒.In the case that the intensityfluc-tuation is bounded by5%in our protocol͑i.e.,=1.05͒and the light intensity decreases by a half for every15km in both protocols,the QKD distance of our protocol is only shorter than that of the ideal protocol by less than1.06km if we request the same key rate for two protocols.Similar cal-culation shows that even the maximumfluctuation is20%, the shortened distance is less than4km.This shows that the secure distance of currently existing experiments18,19would keep on exceeding100km if they had used the proposed method here.Since currently existing experimental results18,19have not adopted our protocol͑producing differ-ent intensities from the same laser device with attenuation͒, it should be interesting to redo the decoy-state QKD experi-ment using our protocol for a more secure result.The authors thank Dong Yang,Jun Zhang,and Xian-Min Jin for many helps.This work is partially supported by the National Fundamental Researchy Program of China and the Hi-Tech R&D Program of China.1W.-Y.Hwang,Phys.Rev.Lett.91,057901͑2003͒.2X.-B.Wang,Phys.Rev.Lett.94,230503͑2005͒.3X.-B.Wang,Phys.Rev.A72,012322͑2005͒.4H.-K.Lo,X.Ma,and K.Chen,Phys.Rev.Lett.94,230504͑2005͒;H.-K. Lo,IEEE,International Symposium on Information Theory(ISIT),2004͑IEEE,New York,2004͒,p.137.5X.Ma,B.Qi,Y.Zhao,and H.-K.Lo,Phys.Rev.A72,012326͑2005͒. 6J.W.Harrington,e-print quant-ph/0503002.7R.Ursin,F.Tiefenbacher,T.Schmitt-Manderbach,H.Weier,T.Scheidl, M.Lindenthal,B.Blauensteiner,T.Jennewein,J.Perdigues,P.Trojek,JB. Oemer,M.Fuerst,M.Meyenburg,J.Rarity,Z.Sodnik,C.Barbieri,H. Weinfurter,and A.Zeilinger,e-print quant-ph/0607182.8V.Scarani,A.Acin,G.Robordy,and N.Gisin,Phys.Rev.Lett.92, 057901͑2004͒;C.Branciard,N.Gisin,B.Kraus,and V.Scarani,Phys. Rev.A72,032301͑2005͒.9M.Koashi,Phys.Rev.Lett.93,120501͑2004͒;K.Tamaki,N. Lükenhaus,M.Loashi,and J.Batuwantudawe,e-print quant-ph/0608082. 10C.H.Bennett and G.Brassard,in Proceedings of the IEEE International Conference on Computers,Systems,and Signal Processing͑IEEE, New York,1984͒,pp.175–179.11N.Gisin,G.Ribordy,W.Tittel,and H.Zbinden,Rev.Mod.Phys.74,145͑2002͒.12M.Dusek,N.Lütkenhaus,and M.Hendrych,in Progress in Optics,edited by E.Wolf͑Elsevier,New York,in press͒,V ol.49.13M.Bourennane, F.Gibson, A.Karlsson, A.Hening,P.Jonsson,T. Tsegaye,D.Ljunggren,and E.Sundberg,Opt.Express4,383͑1999͒;D. Stucki,D.Stucki,N.Gisin,O.Guinnard,G.Ribordy,and H.Zbinden, New J.Phys.4,41͑2002͒;H.Kosaka,Electron.Lett.39,1199͑2003͒;C. Gobby,Z.L.Yuan,and A.J.Shields,Appl.Phys.Lett.84,3762͑2004͒; X.-F.Mo,Opt.Lett.30,2632͑2005͒;G.Wu,J.Chen,Y.Li,L.-L.Xu,and H.-P.Zeng,e-print quant-ph/0607099.14B.Huttner,N.Imoto,N.Gisin,and T.Mor,Phys.Rev.A51,1863͑1995͒;H.P.Yuen,Quantum Semiclassic.Opt.8,939͑1996͒.15G.Brassard,N.Lütkenhaus,T.Mor,and B.C.Sanders,Phys.Rev.Lett. 85,1330͑2000͒;N.Lütkenhaus,Phys.Rev.A61,052304͑2000͒;N. Lütkenhaus and M.Jahma,New J.Phys.4,44͑2002͒.16H.Inamori,N.Lütkenhaus,and D.Mayers,e-print quant-ph/0107017;D. Gottesman,H.K.Lo,N.Lütkenhaus,and J.Preskill,Quantum -put.4,325͑2004͒.17Y.Zhao,B.Qi,X.Ma,H.-K.Lo,and L.Qian,Phys.Rev.Lett.96, 070502͑2006͒;Y.Zhao,B.Qi,X.Ma,H.-K.Lo,and L.Qian,ISIT ͑Harbin,2006͒,p.2094.18Cheng-Zhi Peng,Jun Zhang,Dong Yang,Wei-Bo Gao,Huai-Xin Ma,Hao Yin,He-Ping Zeng,Tao Yang,Xiang-Bin Wang,and Jian-Wei Pan, Phys.Rev.Lett.98,010505͑2007͒.19D.Rosenberg,J.W.Harrington,P.R.Rice,P.A.Hiskett,C.G.Peterson, R.J.Hughes,J.E.Nordholt,A.E.Lita,and S.W.Nam,Phys.Rev.Lett. 98,010503͑2007͒.20T.Schmitt-Manderbach,H.Weier,M.Fürst,R.Ursin,F.Tiefenbacher,T. Scheidl,J.Perdigues,Z.Sodnik,C.Kurtsiefer,J.G.Rarity,A.Zeilinger, and H.Weinfurter,Phys.Rev.Lett.98,010504͑2007͒.21Z.L.Yuan,A.W.Sharpe,and A.J.Shields,Appl.Phys.Lett.90,011118͑2007͒.22Xiang-Bin Wang,e-print quant-ph/0609081.Downloaded 23 Sep 2009 to 210.45.72.58. Redistribution subject to AIP license or copyright; see /apl/copyright.jsp。