会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • INTERLOCKING PLAIN TEXT PASSWORDS TO DATA ENCRYPTION KEYS
    • 将数据加密密钥与普通文本密码相互联系
    • US20110087890A1
    • 2011-04-14
    • US12768058
    • 2010-04-27
    • Jeffrey L. MunsilJeffrey L. Williams
    • Jeffrey L. MunsilJeffrey L. Williams
    • H04L9/32G06F21/00
    • G06F21/31G06F21/78H04L9/0866H04L9/3226H04L9/3236H04L2209/12
    • Described embodiments provide for authenticating a user request for access to at least a portion of an encrypted storage device. First, the request for access to at least a portion of the encrypted storage device is received. The request includes a plaintext password. A hash module generates a hashed version of the received plaintext password based on an authentication hash key. A hashed value of the generated plaintext password is retrieved from a key storage. A hash comparator compares the hashed version of the received plaintext password with the retrieved hashed value of the generated plaintext password. If the hashed version of the received plaintext password and the retrieved hashed value of the generated plaintext password are equal, the user is authenticated for access to at least a portion of the encrypted storage device. Otherwise, the user is denied access to the encrypted storage device.
    • 所描述的实施例提供用于认证访问加密存储设备的至少一部分的用户请求。 首先,接收对加密存储设备的至少一部分的访问请求。 该请求包括明文密码。 散列模块基于认证散列密钥生成接收到的明文密码的散列版本。 从密钥存储中检索生成的明文密码的散列值。 哈希比较器将收到的明文密码的散列版本与生成的明文密码的检索散列值进行比较。 如果接收到的明文密码的散列版本和生成的明文密码的检索散列值相等,则认证用户对加密存储设备的至少一部分进行访问。 否则,用户被拒绝访问加密的存储设备。
    • 5. 发明授权
    • Disk drive with adaptive pooling for command reordering
    • 具有自适应池的磁盘驱动器,用于命令重新排序
    • US6145052A
    • 2000-11-07
    • US963772
    • 1997-11-04
    • Steven M. HoweJeffrey L. Williams
    • Steven M. HoweJeffrey L. Williams
    • G06F3/06G11B19/02G06F12/00
    • G06F3/0613G06F3/0659G06F3/0674G11B19/02
    • A method for selecting a next command to execute from a set of SCSI commands where the commands are gracefully aged and performance of a disk drive is improved. An execution threshold age, a pool threshold age, and an age threshold age are used to determine what command is executed next. A mechanical time delay is calculated for a command based on the time required to position the read/write head over the data location requested in each command. A command age is calculated based on a current time and the time the command was received from the host. The command age is checked against the execution threshold age and pool threshold age. Any commands that have aged beyond the execution threshold age are executed. If the oldest command has aged beyond the age threshold age, then any command that has both aged beyond the pool threshold age and has the smallest mechanical time delay is executed, otherwise the command with the smallest mechanical time delay is executed. Alternatively, a time stamp of the oldest command is compared against an age threshold to determine if all or some of the commands are in the pool of commands. If there are no commands that have aged beyond the age threshold, then the command that has the smallest mechanical time delay is executed first.
    • 一种用于从一组SCSI命令中选择执行下一个命令的方法,其中命令被优雅地老化并且提高了磁盘驱动器的性能。 使用执行阈值年龄,池阈值年龄和年龄阈值年龄来确定接下来执行什么命令。 基于将读/写头定位在每个命令中请求的数据位置所需的时间,为命令计算机械时间延迟。 根据当前时间和从主机接收命令的时间计算命令时间。 根据执行阈值年龄和池阈值年龄检查命令时间。 执行老化超过执行阈值时间的任何命令。 如果最旧的命令已经超过年龄阈值年龄,则执行任何年龄超过池阈值年龄并且具有最小机械时间延迟的命令,否则执行机械时间延迟最小的命令。 或者,将最早命令的时间戳与年龄阈值进行比较,以确定所有或一些命令是否在命令池中。 如果没有老化超过年龄阈值的命令,则首先执行具有最小机械时间延迟的命令。
    • 7. 发明授权
    • Frame classification using classification keys
    • 使用分类键进行帧分类
    • US5748905A
    • 1998-05-05
    • US701335
    • 1996-08-30
    • Stephen A. HauserJeffrey L. Williams
    • Stephen A. HauserJeffrey L. Williams
    • H04L29/06G06F13/00
    • H04L29/06H04L69/22
    • An improved method and apparatus for recognizing, classifying and processing frames received at a frame processor in a computer network is disclosed. Following receipt of a frame at an input port of a frame processor, source and destination addresses are parsed from the frame. A plurality of lookup tables are provided in a memory, each of which contains a search field and a classification key field. Source or destination addresses are stored in the respective search fields along with other information associated with the frame and a compact classification key is stored in the corresponding classification key field. Searches are performed of the respective search fields within the respective lookup tables to determine whether a match exists between the each of the destination and source addresses and other information and the search field within the lookup tables. In the event the searches yield a match, a classification key associated with each respective address is retrieved. Classification keys corresponding to addresses thus retrieved are concatenated and the concatenated value is employed as the basis for a further search of the search field of another one of the lookup tables to identify a classification key which is employed to specify the manner of further processing of the received frame.
    • 公开了一种用于识别,分类和处理在计算机网络中的帧处理器处接收的帧的改进的方法和装置。 在帧处理器的输入端口接收到帧之后,从帧解析源和目的地址。 在存储器中提供多个查找表,每个查找表包含搜索字段和分类关键字段。 源或目的地地址与其他与该帧相关的信息存储在相应的搜索字段中,并且紧凑的分类密钥存储在相应的分类密钥字段中。 对相应查找表内的各搜索字段执行搜索,以确定目的地和源地址中的每一个与查找表中的其他信息和搜索字段之间是否存在匹配。 在搜索产生匹配的情况下,检索与每个相应地址相关联的分类密钥。 对应于如此检索的地址的分类密钥被连接,并且将级联值用作进一步搜索另一个查找表的搜索字段的基础,以识别用于指定进一步处理的方式的分类密钥 收到帧。