scholarly journals Matrix-Based RSA Encryption of Streaming Data

2021 ◽  
Author(s):  
Michael Prendergast
Keyword(s):  
Streaming Data ◽  
New Method ◽  
Encryption Algorithm ◽  
Public Key ◽  
Invertible Matrix ◽  
Integer Coefficients ◽  
Private Key ◽  
Matrix Generalization ◽  
Euler Totient Function ◽  
The Matrix

This paper describes a new method for performing secure encryption of blocks of streaming data. This algorithm is an extension of the RSA encryption algorithm. Instead of using a public key (e,n) where n is the product of two large primes and e is relatively prime to the Euler Totient function, φ(n), one uses a public key (n,m,E), where m is the rank of the matrix E and E is an invertible matrix in GL(m,φ(n)). When m is 1, this last condition is equivalent to saying that E is relatively prime to φ(n), which is a requirement for standard RSA encryption. Rather than a secret private key (d,φ(n)) where d is the inverse of e (mod φ(n)), the private key is (D,φ(n)), where D is the inverse of E (mod (φ(n)). The key to making this generalization work is a matrix generalization of the scalar exponentiation operator that maps the set of m-dimensional vectors with integer coefficients modulo n, onto itself.

A new method for generating keys in the RSA cryptosystem

2020 ◽  
Vol 20 (2) ◽  
pp. 221-223
Author(s):  
N.V. Markova ◽  
Keyword(s):  
New Method ◽  
Public Key ◽  
Rsa Cryptosystem ◽  
The Public ◽  
Private Key ◽  
New Construction

V.A. Bykovsky built a new version of the RSA cryptosystem, in which for the same private key lengths the length of the public key decreases asymptotically by a factor of three. The paper proposes a new construction on this theme, in which the length of the public key is reduced by more than three times.

scholarly journals Hybridization of Vigenere Technique with the Collaboration of RSA for Secure Communication

2019 ◽  
pp. 6-13 ◽  
Keyword(s):  
Communication System ◽  
Data Security ◽  
Secure Communication ◽  
Encryption Algorithm ◽  
Public Key ◽  
Hybridization Method ◽  
The Public ◽  
Private Key ◽  
Asymmetric Encryption ◽  
Thesis Work

The security factor is one of the major concerns in today’s world. As security is the breath of communication, as much as we can make our communication system secure, the system will be more trustworthy and be more restricted to snap as well as can save guard from the unauthorized attempt. Either symmetric or asymmetric encryption was used in the earlier method to ensure data security. However, any of them alone makes the system either unsecured or time-consuming. In our thesis work, we have used both the techniques together to make the system as much as reliable and also to make it faster using the hybridization of asymmetric RSA encryption and symmetric modified vigenere technique. This hybridization method sends the vigenere table as an encrypted string using an asymmetric process with the collaboration of the RSA encryption algorithm where the string will be encrypted by the public key generated by the receiver. Later the string will be decrypted using the receiver’s private key. Therefore, we can claim that the extended vigenere method with the collaboration of RSA makes the overall communication more secure, stable, reliable, and faster.

scholarly journals A new method for identifying the role of marital preferences at shaping marriage patterns

2021 ◽  
pp. 1-27
Author(s):  
Anna Naszodi ◽  
Francisco Mendonca
Keyword(s):  
Contingency Table ◽  
Transformation Method ◽  
New Method ◽  
Marriage Patterns ◽  
The Us ◽  
Analytical Properties ◽  
The Matrix ◽  
Transformation Methods

Abstract We develop a method which assumes that marital preferences are characterized either by the scalar-valued measure proposed by Liu and Lu, or by the matrix-valued generalized Liu–Lu measure. The new method transforms an observed contingency table into a counterfactual table while preserving its (generalized) Liu–Lu value. After exploring some analytical properties of the new method, we illustrate its application by decomposing changes in the prevalence of homogamy in the US between 1980 and 2010. We perform this decomposition with two alternative transformation methods as well where both methods capture preferences differently from Liu and Lu. Finally, we use survey evidence to support our claim that out of the three considered methods, the new transformation method is the most suitable for identifying the role of marital preferences at shaping marriage patterns. These data are also in favor of measuring assortativity in preferences à la Liu and Lu.

scholarly journals BESTIE: Broadcast Encryption Scheme for Tiny IoT Equipment

Electronics ◽  
2020 ◽  
Vol 9 (9) ◽  
pp. 1389
Author(s):  
Jiwon Lee ◽  
Jihye Kim ◽  
Hyunok Oh
Keyword(s):  
The Other ◽  
Public Key ◽  
Broadcast Encryption ◽  
Encryption Scheme ◽  
The Public ◽  
Private Key ◽  
Diffie Hellman ◽  
The Standard Model ◽  
Encryption Decryption ◽  
Subset Difference

In public key broadcast encryption, anyone can securely transmit a message to a group of receivers such that privileged users can decrypt it. The three important parameters of the broadcast encryption scheme are the length of the ciphertext, the size of private/public key, and the performance of encryption/decryption. It is suggested to decrease them as much as possible; however, it turns out that decreasing one increases the other in most schemes. This paper proposes a new broadcast encryption scheme for tiny Internet of Things (IoT) equipment (BESTIE), minimizing the private key size in each user. In the proposed scheme, the private key size is O(logn), the public key size is O(logn), the encryption time per subset is O(logn), the decryption time is O(logn), and the ciphertext text size is O(r), where n denotes the maximum number of users, and r indicates the number of revoked users. The proposed scheme is the first subset difference-based broadcast encryption scheme to reduce the private key size O(logn) without sacrificing the other parameters. We prove that our proposed scheme is secure under q-Simplified Multi-Exponent Bilinear Diffie-Hellman (q-SMEBDH) in the standard model.

scholarly journals Detection of Forgery and Fabrication in Passports and Visas using Cryptography and QR Codes

2021 ◽  
Vol 12 (1) ◽  
pp. 1-11
Author(s):  
Cheman Shaik
Keyword(s):  
Mobile App ◽  
Public Key ◽  
Qr Code ◽  
Clear Indication ◽  
Qr Codes ◽  
The Public ◽  
Private Key ◽  
The World ◽  
Cryptographic Key ◽  
Google Play

In this paper, we present a novel solution to detect forgery and fabrication in passports and visas using cryptography and QR codes. The solution requires that the passport and visa issuing authorities obtain a cryptographic key pair and publish their public key on their website. Further they are required to encrypt the passport or visa information with their private key, encode the ciphertext in a QR code and print it on the passport or visa they issue to the applicant. The issuing authorities are also required to create a mobile or desktop QR code scanning app and place it for download on their website or Google Play Store and iPhone App Store. Any individual or immigration uthority that needs to check the passport or visa for forgery and fabrication can scan its QR code, which will decrypt the ciphertext encoded in the QR code using the public key stored in the app memory and displays the passport or visa information on the app screen. The details on the app screen can be compared with the actual details printed on the passport or visa. Any mismatch between the two is a clear indication of forgery or fabrication. Discussed the need for a universal desktop and mobile app that can be used by immigration authorities and consulates all over the world to enable fast checking of passports and visas at ports of entry for forgery and fabrication

scholarly journals HILL CIPHER ON SHAMIR’S THREE PASS PROTOCOL

2017 ◽  
Author(s):  
hasdiana
Keyword(s):  
Matrix Element ◽  
Execution Time ◽  
Invertible Matrix ◽  
Multidisciplinary Research ◽  
The Third ◽  
Xor Operation ◽  
Hill Cipher ◽  
The Matrix ◽  
Level Of Difficulty ◽  
Time Required

This preprint has been presented in the 3rd International Conference on Multidisciplinary Research, Medan, october 16 – 18, 2014---In this study the authors use the scheme of Shamir's Three Pass Protocol for Hill Cipher operation. Scheme of Shamir's Three Pass Protocol is an attractive scheme that allows senders and receivers to communicate without the key exchange. Hill Cipher is chosen because of the key-shaped matrix, which is expected to complicate the various techniques of cryptanalyst. The results of this study indicate that the weakness of the scheme of Shamir's Three Pass Protocol for XOR operation is not fully valid if it is used for Hill Cipher operations. Cryptanalyst can utilize only the third ciphertext that invertible. Matrix transpose techniques in the ciphertext aims to difficulties in solving this algorithm. The original ciphertext generated in each process is different from the transmitted ciphertext. The level of difficulty increases due to the use of larger key matrix. The amount of time required for the execution of the program depends on the length of the plaintext and the value of the matrix element. Plaintext has the same length produce different execution time depending on the value of the key elements of the matrix used.

scholarly journals Survey on Asymmetric Key Cryptographic Algorithms

2020 ◽  
pp. 404-408
Author(s):  
Sabitha S ◽  
Binitha V Nair
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
The Public ◽  
Private Key ◽  
Design And Implementation ◽  
Diffie Hellman ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Symmetric Key ◽  
Symmetric Key Cryptography

Cryptography is an essential and effective method for securing information’s and data. Several symmetric and asymmetric key cryptographic algorithms are used for securing the data. Symmetric key cryptography uses the same key for both encryption and decryption. Asymmetric Key Cryptography also known as public key cryptography uses two different keys – a public key and a private key. The public key is used for encryption and the private key is used for decryption. In this paper, certain asymmetric key algorithms such as RSA, Rabin, Diffie-Hellman, ElGamal and Elliptical curve cryptosystem, their security aspects and the processes involved in design and implementation of these algorithms are examined.

Sign in / Sign up

Export Citation Format

Share Document