|
| |
| | Cryptographic engineering - Wikipedia, the free encyclopedia |
 | | Cryptographic designs also have performance goals (eg, unbreakability of encryption), but must perform in a more complex, and more complexly hostile, environment than merely high (but not too low) in the Earth's atmosphere under war conditions. |  | | The effect of most of these will not be apparent to end users, generally not to the computer system's administrators, and often not even to the cryptographic system's designers. |  | | This article is an overview of cryptographic engineering which notes at least some of the differences between ordinary engineering and the cryptographic sort. |
|
http://en.wikipedia.org/wiki/Cryptographic_engineering
(983 words)
|
|
| |
| | Cryptography - Wikipedia, the free encyclopedia |
 | | Moreover, people without extraordinary needs for secrecy use cryptographic technology, which is often built transparently into much of computing and telecommunications infrastructure. |  | | Cryptographic protocols specify the details of how ciphers (and other cryptographic primitives) are to be used to achieve specific tasks. |  | | Unsolved problems in computer science: One-way functions are functions that are easy to compute but hard to invert. |
|
http://en.wikipedia.org/wiki/Cryptography
(983 words)
|
|
| |
| | Cryptography - Wikipedia, the free encyclopedia |
 | | Cryptography is also considered a branch of engineering, but it is considered to be an unusual one as it deals with active, intelligent and malevolent opposition (see cryptographic engineering and security engineering). |  | | Moreover, people without extraordinary needs for secrecy use cryptographic technology, which is often built transparently into much of computing and telecommunications infrastructure. |  | | Cryptographic protocols specify the details of how ciphers (and other cryptographic primitives) are to be used to achieve specific tasks. |
|
http://en.wikipedia.org/wiki/Cryptography
(2438 words)
|
|
| |
| | Electronic signature - Wikipedia, the free encyclopedia |
 | | It is important to understand the cryptographic signatures are much more than an error checking technique akin to checksum algorithms, or even high reliability error detection and correction algorithms such as Reed-Solomon. |  | | In fact, in modern practice, a digital signature of some text is always electronically processed in some sense for the cryptographic mechanisms are impracticable without computers. |  | | None of the electronic signatures in these examples are digital signatures in that there is no cryptographic assurance of the sender's identity and no integrity check on the text received, but all are electronic signatures, and all have been found legally binding in some circumstances. |
|
http://en.wikipedia.org/wiki/Electronic_signature
(2438 words)
|
|
| |
| | FIPS 140-1 - Security Requirements for Cryptographic Modules |
 | | The cryptographic algorithm shall be tested by operating the algorithm on data for which the correct output is already known (i.e., a "known-answer" test). |  | | A cryptographic mechanism using a FIPS approved authentication technique (e.g., the computation and verification of a data authentication code or NIST digital signature algorithm) shall be applied to the cryptographic software within the cryptographic module. |  | | Cryptographic key management is concerned with the entire life cycle of the cryptographic keys employed with a cryptographic-based security system, including their generation, distribution, entry and use, storage, destruction and archiving. |
|
http://www.itl.nist.gov/fipspubs/fip140-1.htm
(2438 words)
|
|
| |
| | Security Policies: Windows 2000 Cryptographic Providers |
 | | The cryptographic boundary for DSSBASE is defined as the enclosure of the computer system on which the cryptographic module is to be executed. |  | | The cryptographic boundary for DSSENH is defined as the enclosure of the computer system on which the cryptographic module is to be executed. |  | | The cryptographic boundary for RSABASE is defined as the enclosure of the computer system on which the cryptographic module is to be executed. |
|
http://www.microsoft.com/technet/security/prodtech/Windows2000/wn2cspsp.mspx
(2438 words)
|
|
| |
| | Analyzing cryptographic protocols |
 | | Abadi and Needham, 1994] it is given eleven design principals when designing cryptographic protocols; among those are the fact that every message should say what it means, and that the protocol designer should know which trust relations his protocol depends on, and why the dependency is necessary. |  | | In the state machine approach, a cryptographic protocol is treated as any other computer program and an attempt is made to prove correctness. |  | | With this method, the protocol is modeled as an algebraic system, where the state is expressed as the participants' knowledge about the protocol, and where different states' attainability is analyzed. |
|
http://www.pasta.cs.uit.no/thesis/html/ronnya/node30.html
(693 words)
|
|
| |
| | ADA272551 : Access to Classified Cryptographic Information. DODD-5205.8 |
 | | Classified cryptographic media that embody, describe, or implement a classified cryptographic logic, to include, but not be limited to, full maintenance manuals, cryptographic descriptions, drawings of cryptographic logic, specifications describing a cryptographic logic, and cryptographic computer software. |  | | Classified cryptographic information is especially sensitive because it is used to protect other classified information. |  | | If a cryptographic system is compromised, but the compromise is not reported, the continued use of the system can result in the loss of all information protected by it. |
|
http://www.fas.org/irp/doddir/dod/dodcrypt.htm
(1071 words)
|
|
| |
| | Lewis Robart M.Sc Abstract |
 | | Comparisons between protocols based on private-key and public-key cryptosystems are also presented, to aid designers in determining the appropriate cryptographic algorithm to use in specific instances. |  | | Cryptographic protocols may contain flaws or weaknesses; efficient and effective means of analyzing these protocols are required. |  | | Cryptographic protocols, utilizing cryptographic algorithms, are used to address security issues in PCS, such as privacy and authentication. |
|
http://adonis.ee.queensu.ca/pn/robart_thesis_abs.html
(300 words)
|
|
| |
| | CRYPTO Publications |
 | | The NRL Protocol Analyzer is a special-purpose verification tool, written in Prolog, that has been developed for the analysis of cryptographic protocols that are used to authenticate principals and services and distribute keys in a network. |  | | The NRL Protocol Analyzer is a prototype special-purpose verification tool, written in Prolog, that has been developed for the analysis of cryptographic protocols that are used to authenticate principals and services and distribute keys in a network. |  | | In this paper we develop a model of computation for the NRL Protocol Analyzer by modifying and extending the model of computation for Burroughs, Abadi, and Needham (BAN) logic developed by Abadi and Tuttle. |
|
http://chacs.nrl.navy.mil/publications/CHACS/CRYPTOindex.html
(6521 words)
|
|
| |
| | Security Protocols over Open Networks and Distributed Systems: Formal Methods for their Analysis, Design, and Verification |
 | | After the discovery of flaws in a protocol, the flaws are often corrected or approaches are being adopted to avoid using the reasoning of the flawed protocols [4]. |  | | The NRL Protocol Analyzer has been used successfully to locate a series of previously unknown flaws in a number of protocols [45] [46], and to demonstrate flaws that were already known in the literature [47]. |  | | CAPSL is proposed as a single common protocol specification language that can be used as the input format for any formal analysis technique, such as Prolog state-search analysis tools [18], the NRL Protocol Analyzer [16] [17], model-checking with FDR [15], and HOL [8]. |
|
http://www.dmst.aueb.gr/dds/pubs/jrnl/1997-CompComm-Formal/html/formal.htm
(11061 words)
|
|
| |
| | Yusuf.doc |
 | | The authentication is implicit to a cryptographic signature whenever the decrypted hash values and the computed hash values match: Only the holder of the private key could have encrypted it, since the public key decrypted a valid hash value. |  | | Cryptographic Signatures As a result of the limitations of the DNS protocol, the Internet Engineering Task Force (IETF) has convened the DNSSEC Working Group (DNSSEC WG) to address the fundamental lack of security by adding DNSSEC extensions to the existing protocol. |  | | The cryptographic signature and the public key used for verification of a signature are retrieved through queries and responses, just like any other piece of information within the DNS. |
|
http://www.eas.asu.edu/trace/eee459/Yusuf.doc
(11061 words)
|
|
| |
| | Dagstuhl Seminar 01391 "Specification and Analysis of Secure Cryptographic Protocols" (September, 23-28, 2001) |
 | | Natural candidates for a classification scheme are: synchronous versus asynchronous communication, complexity, decidability, practicability, which class of cryptographic protocols can be modelled (point-to-point, group communication, etc.), which cryptographic and other computations are supported, which analysis techniques are supported, and what is the scope, extensibility, and reusability of the modelling formalism. |  | | Cryptographic protocols are vulnerable to message modification attacks and it is surprisingly difficult to get even small protocols right. |  | | Cryptographic protocols are the cornerstone of secure electronic communication, banking, and commerce. |
|
http://www.csl.sri.com/users/denker/dagstuhl/topics.html
(654 words)
|
|
| |
| | Cryptographic Button Program - CANBERRA, An AREVA Group Company |
 | | In either case, the instrument processor must perform the data formatting and hashing; however, the cryptographic iButton can be the means of secure key generation and storage as well as provide final signatures of the data digest. |  | | The cryptographic iButton provides the enabling technology that may allow safeguards agencies to implement cryptographically secure access to the sensitive Safeguards data as well as auditably demonstrate to the member countries that information about their facilities is rigorously access-controlled. |  | | Furthermore, it is a more reliable method of key possession than the commonly used method of placing the key onto a floppy disk; the iButton is more difficult to duplicate and the proliferation of the key can be more effectively controlled. |
|
http://www.canberra.com/literature/1071.asp
(654 words)
|
|
| |
| | Csur - C cryptographic protocols analyzer |
 | | Csur is a project about automatic analysis of cryptographic protocols written in C. Csur uses a new hybrid analysis of C code: programs represent roles of agents in protocols and a static analysis computes message exchange between agents of protocols. |  | | Static analysis, abstract interpretation, C code analysis, pointer analysis, cryptographic protocols analysis, cryptographic protocols analyzer, Horn clauses, First order logic. |  | | is the analyzer and performs cryptographic protocols analysis. |
|
http://www.lsv.ens-cachan.fr/csur
(681 words)
|
|
| |
| | Java Cryptography Architecture |
 | | An engine class defines a cryptographic service in an abstract fashion (without a concrete implementation). |  | | Given the public key corresponding to the private key used to generate the signature, it should be possible to verify the authenticity and integrity of the input. |  | | This algorithm is the key pair generation algorithm described in NIST FIPS 186 for DSA. |
|
http://java.sun.com/j2se/1.4/docs/guide/security/CryptoSpec.html
(681 words)
|
|
| |
| | SPEAR: a Security Protocol Engineering & Analysis Resource |
 | | To our knowledge, however, there are no tools that allow for the easy specification of cryptographic protocols combining both the logics and the formal protocol specifications in such a way as to distil the critical issues and present the user with a higher level design overview. |  | | The security of a protocol refers to the secureness of the actual message interchange, the applicability of the respective cryptographic methods, the type and quantity of data sent across insecure channels and the possible attacks that the protocol may be susceptible to. |  | | It is widely recognized that the engineering of cryptographic protocols is a very subtle task which can easily be deceptive to developers. |
|
http://www.cs.uct.ac.za/Research/DNA/SPEAR/dist/spear.html
(3544 words)
|
|
| |
| | Validation and Semantics of XML Digital Signatures |
 | | 1) Use the cryptographic algorithm parameter definitions in the signature to determine: the appropriate hash algorithm, signature algorithm, signature format, asymmetric algorithm parameters and public key to use in the validation process. |  | | The validation of a signature includes not only the cryptographic processing, but also the determination that a key was trusted to sign a specific piece of information. |  | | Signatures on objects are of the form: "In {schema}, {key_holder} says {object}has {property}". |
|
http://www.w3.org/DSig/signed-XML99/pp/certicom.html
(3544 words)
|
|
| |
| | Cryptographic protocols |
 | | On the properties of cryptographic protocols and the weaknesses of the BAN-like logics. |  | | Questions of belief are essential in analyzing protocols for authentication in distributed computing systems. |  | | In this paper we present a protocol to show that both BAN and AT are not expressive enough to capture all of the kinds of flaws that appear to be within their scope. |
|
http://www.di.ens.fr/~monniaux/biblio/protocols.html
(1804 words)
|
|
| |
| | CRYPTO Publications |
 | | However, the effectiveness of equational unification in cryptographic protocol analysis has been hampered by the lack of unification algorithms that can be used to reason about some of the more equationally rich algorithms used by many cryptographic systems, such as Diffie-Hellman, group Diffie-Hellman, and blinded signatures. |  | | Although research has been going on in the formal analysis of cryptographic protocols for a number of years, they are only slowly being integrated into the protocol design process. |  | | The growing interest in the application of formal methods of cryptographic protocol analysis has led to the development of a number of different techniques for generating and describing invariants that are defined in terms of what messages an intruder can and cannot learn. |
|
http://chacs.nrl.navy.mil/publications/CHACS/CRYPTOindex.html
(6521 words)
|
|
| |
| | Cryptographic key - encyclopedia article about Cryptographic key. |
 | | Encryption algorithms which use the same key for both encryption and decryption are known as symmetric key algorithms Symmetric-key algorithms are a class of algorithms for cryptography that use trivially related cryptographic keys for both decryption and encryption. |  | | Keys are also used in other cryptographic algorithms, such as digital signature Digital signature (or public-key digital signature) is a type of method for authenticating digital information analogous to ordinary physical signatures on paper, but implemented using techniques from the field of public-key cryptography. |  | | There is a distinction between key management, which concerns keys at the users' level (ie, passed between systems or users or both), and key scheduling which is usually taken to apply to the handling of key material within the operation of a cipher. |
|
http://encyclopedia.thefreedictionary.com/cryptographic%20key
(2824 words)
|
|
| |
| | Dr. Cetin Kaya Koc - Biography |
 | | Koç's research interests are in cryptographic engineering, algorithms and architectures for cryptography, computer arithmetic and finite fields, parallel algebraic computation, and network security. |  | | Koç has been working as a consulting engineer with research and development interests in cryptographic engineering and embedded systems for several companies including Intel, RSA Security, and Samsung Electronics. |  | | Koç was the Guest Editor of the special issue in April 2003 of IEEE Transactions on Computers on cryptographic hardware and embedded software development. |
|
http://islab.oregonstate.edu/koc/Biography.html
(301 words)
|
|
| |
| | Digital Signatures and PKCS#11 Smart Cards - Whitepaper : California Software |
 | | PKCS#11, also known as Cryptoki, was defined by RSA and is a generic cryptographic token interface. |  | | Even though PKI is established and cryptographic standards are in place, not much of standardization has occurred on how digital signatures are actually used in a software application context. |  | | Digital signature Algorithm and RSA (developed by RSA labs) are most widely used key-pair generation mechanism used in the industry. |
|
http://www.cswl.com/whiteppr/white/digital.html
(301 words)
|
|
| |
| | Brute force attacks on cryptographic keys |
 | | Many cryptographic systems have no (practical) known weaknesses and so the only way of "cracking" them is to use a "brute force attack" by trying all possible keys until the message can be decoded. |  | | It is designed to foil attempts of a solver to exploit parallel or distributed computing to speed up the computation. |  | | Minimal key lengths for symmetric ciphers to provide adequate commercial security: A report by an ad hoc group of cryptographers and computer scientists, January 1996. |
|
http://www.cl.cam.ac.uk/users/rnc1/brute.html
(301 words)
|
|
| |
| | Cryptographic Polling Protocols |
 | | Chaum proposed the first published cryptographic voting protocol in a 1981 paper on anonymous electronic mail and digital pseudonyms [3]. |  | | The authors maintain that the simplest of their protocols does not require computations on the part of the voter that are outside ``the range of normal human ability.'' However, the more complex protocols that have fewer requirements for trusting election authorities would require the voter to bring a personal computing device into the voting booth. |  | | In the Two Agency Protocol developed by Nurmi, Salomaa, and Santean [15], the responsibilities of validating registered voters and computing and publishing the results of the election are divided between two agencies, as in the simplistic scheme. |
|
http://lorrie.cranor.org/voting/sensus/ssp/node12.html
(1321 words)
|
|
| |
| | CIS 6930 Cryptographic Protocols |
 | | An authentication protocol is an exchange of messages having a specific form for authentication of principals using cryptographic algorithms. |  | | Any logic-based method to analyze an authentication protocol will try to derive these two levels of beliefs in order to state that the authentication protocol is flawless. |  | | But in fact there is a flaw in NSSK protocol that couldn’t be discovered by BAN analysis because of the dubious assumption. |
|
http://www.cise.ufl.edu/~nemo/crypto/giri.htm
(1679 words)
|
|
| |
| | koc |
 | | Koc's research interests are in cryptographic engineering, algorithms and architectures for cryptography, computer arithmetic and finite fields, parallel algebraic and numerical computation, and network security. |  | | We will give an overview of the subject and summarize our research and development projects in cryptographic engineering, for example, efficient implementations of elliptic curve cryptography on embedded software platforms, creation of scalable and unified hardware architectures for public-key cryptosystems, and the design of true random number generators. |  | | Koc has been working as a consulting engineer with research and development interests in cryptographic design and high-speed computing for several organizations and companies including Intel Corporation and RSA Security. |
|
http://www.cs.pdx.edu/~hamlet/colloquium/koc
(297 words)
|
|
| |
| | Clear Signatures, Obscure Signs |
 | | Some have argued that other technologies might be able to create digital signatures of approximately equal security to cryptographic signatures, although none of these techniques has received the degree of theoretical scrutiny that cryptography has received. |  | | An electronic signature could be a certified cryptographic signature of the kind detailed in the first section, but it could also be the signer’s name in ASCII at the end of an e-mail, or the scanned image of a signer’s signature found in a fax or a graphics file. |  | | Cryptography is a process by which data (which could be anything from a text e-mail message, to a digital picture, to a binary software program, to streaming data of a real-time digital phone conversation) is kept secret by scrambling it so as to render it unintelligible gibberish to eavesdroppers. |
|
http://www.bc.edu/bc_org/avp/law/st_org/iptf/articles/content/1999070101.html
(297 words)
|
|
| |
| | 6.805/STS085: A Comparison of Digital and Handwritten Signatures |
 | | Similarly, the signature algorithms are undergoing rapid evolution in terms of cryptographic key size, and even adoption of entirely new cryptographic techniques, such as the move to elliptic curve based algorithms from those based on factoring products of prime numbers. |  | | While handwritten signatures are subject to forgery in a way that digital signatures, by virtue of their cryptographic properties, are not, digital signatures are subject to compromise (loss or disclosure) of the signers private key, just as Sumerian and Roman seals were subject to loss or theft. |  | | A fundamental difference, then, between digital signatures and handwritten signatures is that digital signatures require the intervention of a computer to be applied - and computers are subject to both accidental errors and malicious subversion. |
|
http://www-swiss.ai.mit.edu/6805/student-papers/fall97-papers/fillingham-sig.html
(297 words)
|
|
|