Patent
Multi-dimensional encryption
Toan Le Tri Nguyen,Vinh H. Vo +1 more
- 14 Nov 2014
2
TL;DR: In this article, a method of encrypting data is presented, which includes generating a key and encrypting encrypted data using the key, and the method includes determining the number of coefficients for a polynomial having a number of variables.
read more
Abstract: A method of encrypting data is provided. The method includes generating a key and encrypting data using the key. Generating the key includes determining a number of coefficients for a polynomial having a number of variables and selecting a polynomial level from the number of coefficients. Generating the key also includes selecting a first value based on the polynomial level, generating a vector (c) having coefficients based on the polynomial level, and generating a vector (t) based on the polynomial level. Furthermore, generating the key includes generating a vector (t′) based on a product of the vector (c) and the vector (t) and calculating a second value based on the first value, the vector (t), and the product. In addition, generating the key includes comparing the second value with the polynomial level and returning the coefficients of the vector (c) as the number of coefficients for the polynomial.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Encryption method and device, equipment and medium
Wang Xi,Chen Xiangrong,Chen Wenbin +2 more
- 12 Apr 2019
TL;DR: In this paper, the authors described an encryption method and device, equipment and a medium, which is carried out on each character in a to-be-encrypted plaintext, where byte lengths of a ciphertext and the plaintext are consistent, constraint of a data format is not broken, and when different plaintexts are encrypted, the generated ciphertext is different, so a data operation error resulting from the same ciphertexts is avoided, and data accuracy is ensured.
3
Patent
Methods and systems for enhanced data-centric encryption systems using geometric algebra
Carlos A. Paz de Araujo
- 02 Aug 2017
TL;DR: In this article, the authors present methods and systems to encrypt and decrypt a data message using Geometric Algebra (GAA) using the geometric product (Clifford Product) of a multivector created from plain text/data of the data message with one or more other multivectors that carry encryption keys, the identity of the source, and other data-centric information.
References
The advanced encryption standard
TL;DR: The Advanced Encryption Standard (AES), which has been approved after an international competition by the National Institute of Standards and Technology, is described.
885
A hybrid lattice-reduction and meet-in-the-middle attack against NTRU
Nick Howgrave-Graham
- 19 Aug 2007
TL;DR: It is shown that by combining lattice reduction and a meet-in-the-middle strategy one can reduce the number of loops in attacking the NTRUEncrypt private key from 284.2 to 260.3, for the k = 80 parameter set.
Patent
Elliptic curve encryption systems
Scott A. Vanstone,Ronald C. Mullin,Gordon B. Agnew +2 more
- 31 Jul 1995
TL;DR: A key is generated from multiple additions of one or more points in a finite field as discussed by the authors, and inverses of values are computed using finite field multiplier and successive exponentiations.
131
Patent
Cryptography using finite fields of odd characteristic on binary hardware
Mats Näslund,Rolf Blom +1 more
- 17 Oct 2002
TL;DR: In this article, a cryptographic method for storing binary data representing at least a portion of a field element of an odd-characteristic finite field GF(pk) in a register, p being an odd prime number, was described.
20
Patent
Key generating apparatus, program, and method
Koichiro Akiyama,Yasuhiro Goto +1 more
- 30 Nov 2006
TL;DR: In this article, a key generating apparatus generates a fibration X(x, y, t)=0 of an algebraic surface X serving as part of a public key and defined on a finite field F q (where q=p r [p is a prime number and r is an extended degree]) and a private key which is two sections D 1 and D 2 corresponding to the fibration x(x.y, t), t = 0.
10
Related Papers (5)
Zhou Yashun,Li Lichun,Yin Shan,Wang Huazhong +3 more
- 21 Jun 2019
Xin Li,Larry Pileggi +1 more
- 07 Oct 2005
Yasuda Masaya,Shimoyama Takeshi,Kogure Atsushi +2 more
- 16 Feb 2015