Safeguarding cryptographic keys
1979 International Workshop on Managing Requirements Knowledge (MARK)Published 1 June 1979
G. R. Blakley
Citations3,379
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Certain cryptographic keys, such as a number which makes it possible to compute the secret decoding exponent in an RSA public key cryptosystem, 1 , 5 or the system master key and certain other keys in a DES cryptos system, 3 are so important that they present a dilemma.
Abstract
The following topics are dealt with: operating systems (computers); security of data; multiprocessing systems; software engineering; microprocessor chips; software maintenance; software metrics; relational databases; computer networks; storage management.
Keywords
Computer Science
Communications of the ACMA method for obtaining digital signatures and public-key cryptosystems
13,083 Citations1978Ronald L. Rivest, Adi Shamir +1 more
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys.
Bell System Technical JournalCodes Which Detect Deception
377 Citations1974E. N. Gilbert, F. MacWilliams +1 more
If the key can take K values, then an optimal strategy for B secures him a probability of an undetected substitution ≪ K−1, and several encoding functions Φ(.,.) are given, some of which achieve this bound.
Computers & Mathematics with ApplicationsRivest-Shamir-Adleman public key cryptosystems do not always conceal messages
67 Citations1979G. R. Blakley, I. Borosh
This paper treats questions for a general square free encoding modulus m, which contains easy to use necessary and sufficient conditions that the function f(x) = xc be a permutation of the residue classes module m; and provides a construction of all such “deranging” exponents.
CryptologiaASSESSMENT OF THE NATIONAL BUREAU OF STANDARDS PROPOSED FEDERAL DATA ENCRYPTION STANDARD
34 Citations1977Robert H. Morris, N. J. A. Sloane +1 more
The National Bureau of Standards has implemented a Data Encryption Standard (DES), describing an encryption procedure to be used by Federal agencies and others to protect data against unauthorized access that encrypts 64-bit data sequences using a 56-bit key.
Cambridge University Press eBooksProbabilistic algorithms
2 Citations2005Victor Shoup
A deterministic algorithm would be to expand Q(x, y) to individual terms, opening all parentheses, and then cancel out all equal terms with opppsite signs.