nsa-patents.htm
e4aa1aff0ec63fae2d46917c21cee49f68c6bbfa4b42aaa2aa3933e671e1c0b0<HTML>
<HEAD>
<!-- Created with AOLpress/2.0 -->
<TITLE>NSA Patents</TITLE>
</HEAD>
<BODY BGCOLOR="#ffffff">
<P>
29 May 1999
<P>
<HR>
<P>
National Security Agency-owned patents accessed at the
<A HREF="http://patents.uspto.gov/access/search-bool.html">US Patent Office
online</A> 28 May 1999. Obtained by search for "National Security Agency,"
though oddly none of the patents disclose the full name. This does not include
all the NSA-sponsored patents, such those not owned/attributable to the agency
or those classified and prohibited to public access. Full PTO text of patents
mirrored here. See <A HREF="http://www.patents.ibm.com/ibm.html">IBM's patent
server</A> for text and related images.
<P>
<HR>
<P>
<A HREF="http://jya.com/nsa5832478.htm">http://jya.com/nsa5832478.htm</A><BR>
<TABLE WIDTH="100%">
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B>United States Patent </B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B> 5,832,478 </B></TD>
</TR>
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B> George </B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B>November 3, 1998 </B></TD>
</TR>
</TABLE>
<P>
<HR>
<FONT size="+1"> Method of searching an on-line dictionary using syllables
and syllable count </FONT><BR>
<BR>
<CENTER>
<B>Abstract</B>
</CENTER>
<P>
The present invention is a method of searching an on-line dictionary in any
language representation using syllables and syllable count and an on-line
dictionary, where the on-line dictionary includes a primary headword field,
a segmented primary headword field, additional unsegmented language
representation (headword) fields as required, additional segmented representation
(headword) fields as required, a syllable count field, additional syllable
count fields as required, and a definition field. The user selects a language
representation for a query and makes the query in the selected language
representation. The present invention then parses the query to determine
if segmented syllables were used in the query and how many, if any. If no
segmented syllables were used in the query, a character string search for
the headword that matches the query is conducted. If the query contains segmented
syllables, a syllable search for headwords that contain the same syllables
in the same locations is conducted. The present invention returns one or
more headwords in the language of the query and their corresponding definitions
in the language of the user. Various wildcard symbols may be used for unknown
syllables and for characters within a syllable, which may include tones.
<P>
<HR>
<P>
<A HREF="http://jya.com/nsa5812609.htm">http://jya.com/nsa5812609.htm</A><BR>
<TABLE WIDTH="100%">
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B>United States Patent </B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B> 5,812,609 </B></TD>
</TR>
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B> McLochlin </B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B>September 22, 1998 </B></TD>
</TR>
</TABLE>
<P>
<HR>
<FONT size="+1"> Communication intercept device using digital drop receivers
in multiple tiers </FONT><BR>
<BR>
<CENTER>
<B>Abstract</B>
</CENTER>
<P>
A communications intercept device that includes an analog-to-digital converter
for digitizing an analog wideband input signal, a first memory for storing
the digitized wideband signal, a first digital drop receiver in a first tier
for selecting signals stored in the first memory, a controller for controlling
which signals are selected, a second memory for storing the signals selected
by the first digital drop receiver, and a second digital drop receiver in
a second tier for selecting signals stored in the second memory under control
of the controller.
<P>
<HR>
<P>
<A HREF="http://jya.com/nsa5631961.htm">http://jya.com/nsa5631961.htm</A><BR>
<TABLE WIDTH="100%">
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B>United States Patent </B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B> 5,631,961 </B></TD>
</TR>
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B> Mills , et al.</B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B>May 20, 1997 </B></TD>
</TR>
</TABLE>
<P>
<HR>
<FONT size="+1"> Device for and method of cryptography that allows third
party access </FONT><BR>
<BR>
<CENTER>
<B>Abstract</B>
</CENTER>
<P>
A device for and method of transmitting an encrypted message and an access
field from a sender to a receiver, where a third party may intercept and
process the transmission. The sender and receiver agree on a session key.
The sender raises an element of a Galois Field to the session key; forms
a temporary device unique key; encrypts the session key with the temporary
device unique key; forms a temporary family key; encrypts an identifier of
the sender and the encrypted session key using the temporary family key;
encrypts a plaintext message using the session key; forms the access field
by concatenating the element of a Galois Field raised to the session key
to the encrypted version of the sender's identifier and the sender's encrypted
session key; concatenates the ciphertext to the access field; and transmits
the access field and the ciphertext to the receiver. The receiver may recover
the plaintext from the sender's transmission. The third party may partially
process the transmission to find the identity of the sender. The third party
may then request an escrowed key that would allow the third party to recover
the plaintext of the sender's message.
<P>
<HR>
<P>
<A HREF="http://jya.com/nsa4897878.htm">http://jya.com/nsa4897878.htm</A><BR>
<TABLE WIDTH="100%">
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B>United States Patent </B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B> 4,897,878 </B></TD>
</TR>
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B> Boll , et al.</B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B>January 30, 1990 </B></TD>
</TR>
</TABLE>
<P>
<HR>
<FONT size="+1"> Noise compensation in speech recognition apparatus
</FONT><BR>
<BR>
<CENTER>
<B>Abstract</B>
</CENTER>
<P>
A method and apparatus for noise suppression for speech recognition systems
which employs the principle of a least means square estimation which is
implemented with conditional expected values. Essentially, according to this
method, one computes a series of optimal estimators which estimators and
their variances are then employed to implement a noise immune metric. This
noise immune metric enables the system to substitute a noisy distance with
an expected value which value is calculated according to combined speech
and noise data which occurs in the bandpass filter domain. Thus the system
can be used with any set of speech parameters and is relatively independent
of a specific speech recognition apparatus structure.
<P>
<HR>
<P>
<A HREF="http://jya.com/nsa4731840.htm">http://jya.com/nsa4731840.htm</A><BR>
<TABLE WIDTH="100%">
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B>United States Patent </B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B> 4,731,840 </B></TD>
</TR>
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B> Mniszewski , et al.</B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B>March 15, 1988 </B></TD>
</TR>
</TABLE>
<P>
<HR>
<FONT size="+1"> Method for encryption and transmission of digital keying
data </FONT><BR>
<BR>
<CENTER>
<B>Abstract</B>
</CENTER>
<P>
A method for the encryption, transmission, and subsequent decryption of digital
keying data. The method utilizes the Data Encryption Standard and is implemented
by means of a pair of apparatus, each of which is selectable to operate as
either a master unit or remote unit. Each unit contains a set of key encryption
keys which are indexed by a common indexing system. The master unit operates
upon command from the remote unit to generate a data encryption key and encrypt
the data encryption key using a preselected key encryption key. The encrypted
data encryption key and an index designator are then downloaded to the remote
unit, where the data encryption key is decrypted for subsequent use in the
encryption and transmission data. Downloading of the encrypted data encryption
key enables frequent change of keys without requiring manual entry or storage
of keys at the remote unit.
<P>
<HR>
<P>
<A HREF="http://jya.com/nsa4567572.htm">http://jya.com/nsa4567572.htm</A><BR>
<TABLE WIDTH="100%">
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B>United States Patent </B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B> 4,567,572 </B></TD>
</TR>
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B> Morris , et al.</B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B>January 28, 1986 </B></TD>
</TR>
</TABLE>
<P>
<HR>
<FONT size="+1"> Fast parallel sorting processor </FONT><BR>
<BR>
<CENTER>
<B>Abstract</B>
</CENTER>
<P>
An information processor is described which is especially suitable for
efficiently sorting large quantities of binary data. Data in a plurality
of storage devices is fed to a plurality of compare-exchange modules and
is then selectively passed back to the storage devices by means of multi-input
switches. A programmable microprocessor controls passage of data through
the various components in an iterative process.
<P>
<HR>
<P>
<A HREF="http://jya.com/nsa4429180.htm">http://jya.com/nsa4429180.htm</A><BR>
<TABLE WIDTH="100%">
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B>United States Patent </B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B> 4,429,180 </B></TD>
</TR>
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B> Unkenholz </B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B>January 31, 1984 </B></TD>
</TR>
</TABLE>
<P>
<HR>
<FONT size="+1"> Apparatus for simultaneous generation of key at two locations
</FONT><BR>
<BR>
<CENTER>
<B>Abstract</B>
</CENTER>
<P>
An apparatus for simultaneously generating identical cipher key at two remote
terminals in a manner which prohibits interception of the key by unauthorized
persons. A circuit comprising three separate wire lines is connected between
the two terminals over geographically separated routes. The circuit is randomly
completed and broken by a switch at each terminal, the switch position being
determined at each terminal by an independent key generator. Cipher key is
communicated by comparing the key generator output and the circuit condition.
<P>
<HR>
<P>
<A HREF="http://jya.com/nsa5812609.htm">http://jya.com/nsa5812609.htm</A><BR>
<TABLE WIDTH="100%">
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B>United States Patent </B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B> 4,161,032 </B></TD>
</TR>
<TR>
<TD ALIGN="LEFT" WIDTH="50%"><B> Williams </B></TD>
<TD ALIGN="RIGHT" WIDTH="50%"><B>July 10, 1979 </B></TD>
</TR>
</TABLE>
<P>
<HR>
<FONT size="+1"> Serial arithmetic functions with magnetic bubble logic elements
</FONT><BR>
<BR>
<CENTER>
<B>Abstract</B>
</CENTER>
<P>
Compact arrangements of two-input magnetic bubble logic gates providing bubble
devices for performing serial integer arithmetic on binary integers are
disclosed. Using only a small number of different types of logic gates, designs
are given for devices for performing serial addition, subtraction, multiplication
and division arithmetic operations on binary integers, represented as sequences
of magnetic bubbles. All logical interactions use bubble repulsion to prevent
bubbles from transferring to adjacent propagation paths via preferred
transitions. By using only two-input gates and a pipeline computational
structure, hardware design is simplified and advantage is taken of the inherent
serial nature of bubble technology. The simple gate interconnection geometry
has a minimum of feedback paths and results in devices which are not burdened
with excessive numbers of bubble generators, annihilators or crossovers.
<P>
<HR>
<P>
</BODY></HTML>
© 2024 Packet Storm. All rights reserved.
%7Cutmcsr%3D(direct)%7Cutmcmd%3D(none)){kind=small}
Follow us on Twitter
Follow us on Facebook
Subscribe to an RSS Feed