Abstract:
L'invention porte sur un procédé cryptographique et ses variantes à base de chiffrement homomorphe permettant l'évaluation de fonctions univariées ou multivariées à valeurs réelles sur des données chiffrées, afin de permettre de réaliser plus largement et efficacement des traitements homomorphes sur des données chiffrées.
Abstract:
L'invention porte sur un procédé cryptographique et ses variantes à base de chiffrement homomorphe permettant l'évaluation de fonctions à valeurs réelles sur des données chiffrées, afin de permettre de réaliser plus largement et efficacement des traitements homomorphes sur des données chiffrées.
Abstract:
본 개시는 LTE(Long Term Evolution)와 같은 4G(4th generation) 통신 시스템 이후 보다 높은 데이터 전송률을 지원하기 위한 5G(5th generation) 또는 pre-5G 통신 시스템에 관련된 것이다. 본 개시의 다양한 실시 예들에 따르면, 무선 통신 시스템에서 기지국의 장치에 있어서, 마스터 FPGA(field programmable gate array); 마스터 FPGA의 제어를 받는 복수의 슬레이브 FPGA들; 및 마스터 FPGA 및 복수의 슬레이브 FPGA들과 연결된 어드레스 마스커를 포함하며, 어드레스 마스커는, 마스터 FPGA에 의하여 각각의 복수의 슬레이브 FPGA들에게 할당된 서로 다른 어드레스 비트들을 수신하고, 서로 다른 어드레스 비트들에 대하여 특정 위치의 비트 값들을 동일한 값으로 마스킹하며, 각각의 복수의 슬레이브 FPGA들에게 대응하는 마스킹된 어드레스 비트들을 송신하도록 구성된 장치가 제공된다.
Abstract:
One embodiment provides a system that facilitates encryption of manifest content based on permutation. During operation, the system partitions, by a computer system, a collection of data into a first set of content objects, wherein a content object is a chunk comprised of a plurality of bytes. The system performs a first permutation function on the first set of content objects to obtain a first set of permuted content objects. The system creates a manifest based on the permuted content objects, wherein a manifest is a content object which indicates a second set of content objects, wherein a respective content object of the second set is a data object or another manifest. The system encodes the first permutation function and the permuted content objects in the manifest, thereby facilitating an authorized entity that receives the manifest to reassemble the manifest contents based on the permutation function.
Abstract:
Examples herein involve a distributed shuffle data system. Shuffle data producers of in-memory shuffle systems of the distributed shuffle data system to perform a map operation on shuffle data and provide location information of the mapped shuffle data to a shuffle coordinator of the shuffle data system. Shuffle data consumers receive the shuffle data location information and retrieve the shuffle data via direct memory access from the shared memories of the in-memory shuffle systems using the shuffle data location information.
Abstract:
Предполагаемое изобретение относится к области вычислительной техники и криптографии и, в частности, к способам реализации линейных преобразований, работающих с заданной скоростью и требующих минимальный расход памяти, для последующего применения в устройствах защиты данных криптографически- ми методами. Техническим результатом является обеспечение возможности выбора взаи- мосвязанных характеристик (быстродействие и объем необходимой памяти) для конкретной вычислительной системы при реализации линейного преобразования большой размерности. Применение предложенного способа позволяет уменьшить количество рас- ходуемой памяти при заданной разрядности применяемых процессоров. Для этого на основе заданного линейного преобразования строят модифици- рованный линейный регистр сдвига типа Галуа или типа Фибоначчи по правилам приведенным в описываемом способе, а его применение позволяет получить описанный результат.
Abstract:
The present invention provides an easy to use web-based system for enabling multiple-user social browsing of underlying video/DEVSA media content. A plurality of user interfaces are employed linked with one or more underlying programming modules and controlling algorithms. A data model is similarly supported and used for managing complex social commenting and details regarding a particular video set of interest. An interest intensity measurement and mapping system and mode are provided for increased use.
Abstract:
Mechanisms are provided for performing a floating point arithmetic operation in a data processing system. A plurality of floating point operands of the floating point arithmetic operation are received and bits in a mantissa of at least one floating point operand of the plurality of floating point operands are shifted. One or more bits of the mantissa that are shifted outside a range of bits of the mantissa of at least one floating point operand are stored and a vector value is generated based on the stored one or more bits of the mantissa that are shifted outside of the range of bits of the mantissa of the at least one floating point operand. A resultant value is generated for the floating point arithmetic operation based on the vector value and the plurality of floating point operands.
Abstract:
A multi-addressable register file is addressed by a plurality of types of instructions, including scalar, vector and vector-scalar extension instructions. It may be determined that data is to be translated from one format to another format. If so determined, a convert machine instruction is executed that obtains a single precision datum in a first representation in a first format from a first register; converts the single precision datum of the first representation in the first format to a converted single precision datum of a second representation in a second format; and places the converted single precision datum in a second register.