scholarly journals RSA Cryptography Algorithm Using linear Congruence Class.

2016 ◽  
Vol 4 (5) ◽  
pp. 1335-1347
Author(s):  
PurnaChandra Sethi ◽  
◽  
PrafullaKumar Behera ◽  
Keyword(s):  
Congruence Class ◽  
Linear Congruence ◽  
Rsa Cryptography

Congruence relations on almost distributive lattices-II

2019 ◽  
pp. 2150005
Author(s):  
Gezahagne Mulat Addis
Keyword(s):  
Distributive Lattice ◽  
Congruence Relation ◽  
Congruence Class ◽  
Distributive Lattices ◽  
Ideal Formula ◽  
Congruence Relations

For a given ideal [Formula: see text] of an almost distributive lattice [Formula: see text], we study the smallest and the largest congruence relation on [Formula: see text] having [Formula: see text] as a congruence class.

Modular exponential accelerator chip based on precomputations for RSA cryptography application

1999 ◽  
Author(s):  
Victor W. Ramschie ◽  
Alex Hariz ◽  
Malcolm R. Haskard
Keyword(s):  
Rsa Cryptography

scholarly journals SUMS OF PRODUCTS OF CONGRUENCE CLASSES AND OF ARITHMETIC PROGRESSIONS

2009 ◽  
Vol 05 (04) ◽  
pp. 625-634
Author(s):  
SERGEI V. KONYAGIN ◽  
MELVYN B. NATHANSON
Keyword(s):  
Arithmetic Progression ◽  
Congruence Class ◽  
Arithmetic Progressions ◽  
Sum Of Products ◽  
Sums Of Products ◽  
Positive Integers ◽  
Congruence Classes

Consider the congruence class Rm(a) = {a + im : i ∈ Z} and the infinite arithmetic progression Pm(a) = {a + im : i ∈ N0}. For positive integers a,b,c,d,m the sum of products set Rm(a)Rm(b) + Rm(c)Rm(d) consists of all integers of the form (a+im) · (b+jm)+(c+km)(d+ℓm) for some i,j,k,ℓ ∈ Z. It is proved that if gcd (a,b,c,d,m) = 1, then Rm(a)Rm(b) + Rm(c)Rm(d) is equal to the congruence class Rm(ab+cd), and that the sum of products set Pm(a)Pm(b)+Pm(c)Pm eventually coincides with the infinite arithmetic progression Pm(ab+cd).

E-Voting with Hybrid Encryption RSA Algorithm

2021 ◽  
Vol 10 (02) ◽  
pp. 225-231
Author(s):  
V.Selva Bhuvaneshwari ◽  
D.Angeline Rangithamani ◽  
K.Aathi Vignesh
Keyword(s):  
Protocol Design ◽  
Hybrid Encryption ◽  
Rsa Algorithm ◽  
Voting System ◽  
Rsa Cryptography ◽  
Server System

E-voting system based on and improved from our previous work .E-voting system, referred to as Enhanced note is enhanced with a new protocol design and watchdog hardware device to ensure voter confidentiality and voting accuracy. The watchdog device records all voting transactions to prevent voter frauds.The RSA cryptography algorithm ensures that votes casted are secured, thus maintaining the privacy of votes.The system is such that when the votes are cast on the nodes, the RSA technique encrypts the vote that is sent to the server system using both node and vote identity number.

scholarly journals Congruence Class Sizes in Finite Sectionally Complemented Lattices

2004 ◽  
Vol 47 (2) ◽  
pp. 191-205 ◽  
Author(s):  
G. Grätzer ◽  
E. T. Schmidt
Keyword(s):  
Congruence Class ◽  
Typical Result ◽  
Complemented Lattices ◽  
The Family ◽  
Complemented Lattice ◽  
Congruence Classes

AbstractThe congruences of a finite sectionally complemented lattice L are not necessarily uniform (any two congruence classes of a congruence are of the same size). To measure how far a congruence Θ of L is from being uniform, we introduce Spec Θ, the spectrum of Θ, the family of cardinalities of the congruence classes of Θ. A typical result of this paper characterizes the spectrum S = (mj | j < n) of a nontrivial congruence Θ with the following two properties:

Sign in / Sign up

Export Citation Format

Share Document