Showing papers on "Data Authentication Algorithm published in 1990"
08 Jan 1990
TL;DR: The LOKI primitive may be used in any mode of operation currently defined for ISO DEA-1, with which it is interface compatible, and two modes of operation which compute a 64-bit and 128-bit, Message Authentication Code (or hash value).
Abstract: This paper provides an overview of the LOKI encryption primitive which may be used to encrypt and decrypt a 64-bit block of data using a 64-bit key. The LOKI primitive may be used in any mode of operation currently defined for ISO DEA-1, with which it is interface compatible [AAAA83]. Also described are two modes of operation of the LOKI primitive which compute a 64-bit, and 128-bit, Message Authentication Code (or hash value). These modes of operation may be used to provide authentication of a communications session, or of data files.
125 citations
Patent•
29 Jan 1990
TL;DR: In this paper, the authors propose a real-time authentication system that can be both hardware and software executable, i.e., password and physical confirmation, and can be used to authenticate a printed document.
Abstract: The document authentication apparatus provides document authentication and authenticity capability. Document authentication requires that the person to be charged apply an authenticating mark on the document indicating intent to authenticate the document. This requirement is analogous to a signature on a printed document and is implemented in the document authentication apparatus electronically through the use of both hardware and software. A program which immediately checks the identicalness of the document at the transmitting and receiving station through a high speed comparison, locks in the document such that no modification can occur and then awaits authentication handshakes from the two end points. Such authentication is real-time and can be both hardware and software executable, i.e., password and physical confirmation.
80 citations
Patent•
16 Nov 1990
TL;DR: In this paper, the authors propose a real-time authentication system that can be both hardware and software executable and can be used to authenticate a document at the transmitting and receiving station through a high speed comparison.
Abstract: The document authentication apparatus provides document authentication and authenticity capability. Document authentication requires that the person to be charged apply an authentication mark on the document indicating intent to authenticate the document. This requirement is analogous to a signature on a printed document and is implemented in the document authentication apparatus electronically through the use of both hardware and software. A program which immediately checks the identicalness of the document at the transmitting and receiving station through a high speed comparison, locks in the document such that no modification can occur and then awaits authentication handshakes from the two end points. Such authentication is real-time and can be both hardware and software executable, i.e., password and physical confirmation.
56 citations
07 May 1990
TL;DR: Authentication approaches used in Digital Equipment Corporation's Distributed System Security Architecture (DSSA) are described and architecture requirements are identified and authentication protocol options based on smart cards and on user-entered passwords are described.
Abstract: Issues related to authentication in a distributed computing environment are discussed. Authentication approaches used in Digital Equipment Corporation's Distributed System Security Architecture (DSSA) are described. Node, user, and process granularity authentication concerns are considered. Authentication is based on a global hierarchic naming structure and public-key cryptography. Directory-resident certificates associating entities with long-term keys are used in conjunction with dynamically signed certificates which represent transient bindings between entities. Distributed system elements can be mutually suspicious. At the node level, special topics considered include the relationship between authentication and secure loading and the relationship between authentication and rule-based policy support. At the user level, architecture requirements are identified and authentication protocol options based on smart cards and on user-entered passwords are described. >
52 citations
01 Nov 1990
TL;DR: In this article, the call for integrity and authentication algorithms within research on cryptography and within evolution of telecommunication is discussed, and Motivations for submitting primitives and details on the submission process are given.
Abstract: The first aim of this paper is to situate the call for integrity and authentication algorithms within research on cryptography and within evolution of telecommunication. Motivations for submitting primitives and details on the submission process are also given.
12 citations
Patent•
17 Dec 1990
TL;DR: In this article, the authentication of the mobile set and the subscriber authentication is implemented simultaneously by one authentication procedure to share the mobile station by plural subscribers without degradation in the throughput. But the authentication protocol is not considered in this paper.
Abstract: PURPOSE:To enable a mobile station to be shared and to prevent illegal use by specifying a authentication confirmation signal and a authentication reply signal of a mobile set and a subscriber with a random number and a secret key and starting the operation when both the signals are coincident. CONSTITUTION:A random number generating circuit 31 generates at first a random number R for an authentication request in a base station and transmits the number to a mobile station. A mobile set 30 enters the random number R and secret keys Ks, Kp of the mobile set and subscriber to a signal conversion circuit 33 to obtain an authentication reply and a communication ciphering key Ke1 and transmits the authentication reply to the base station. The base station inputs the random number R and secret keys Ks, Kp to a signal conversion circuit 32 to obtain an authentication reply and a communication ciphering key Ke2. A comparator circuit 34 compares a bit pattern of the authentication reply received from the mobile station with a bit pattern of the authentication reply generated in the base station, and enables the authentication of the mobile set when they are coincident and disables the recognition in other cases. That is, then the authentication of the mobile set and the subscriber authentication are implemented simultaneously by one authentication procedure to share the mobile station by plural subscribers without degradation in the throughput.
8 citations
01 Jan 1990
TL;DR: “his paper discusses issues related to authentication in a distributed computing environment, and describes authentication approaches employed in Digital Equipment Corporation’s Distributed System Security Architecture (DSSA).
Abstract: “his paper discusses issues related to authentication in a distributed computing environment, and describes authentication approaches employed in Digital Equipment Corporation’s Distributed System Security Architecture (DSSA). Node, user, and process granularity authentication concerns are considered. Authentication is based on a global hierarchic naming structure and public-key cryptography. Directory-resident certificates associating entities with long-term keys are used in conjunction with dynamically signed certificates which represent transient bindings between entities. Distributed system elements can be mutually suspicious. At the node level, special topics considered include the relationship between authentication and Becure loading and the relationship between authentication and debased policy support. At the user level, architectural requirements are identified and authentication protocol options based on smart cards and on user-entered passwords are described.
01 Jan 1990
TL;DR: Some bounds and constructions for authentication/secrecy codes with splitting are given, based on finite geometry and combinatorics.
Abstract: We deal with codes having unconditional security, which means that the security is independent of the computing power. Analogously to the theory of unconditional secrecy due to Shannon [17] Simmons developed a theory of unconditional authentication [19]. In this paper we give some bounds and constructions for authentication/secrecy codes with splitting, based on finite geometry and combinatorics.