1,590 Hits in 4.2 sec

Fast RSA-type cryptosystems using n-adic expansion [chapter]

Tsuyoshi Takagi
1997 Lecture Notes in Computer Science  
We propose two RSA-type cryptosystems using n-adic expansion, where n is the public key.  ...  Deciphering the entire plaintext of this system is as intractable as breaking the RSA cryptosystem or factoring.  ...  Nishio, and members of the cryptology seminar in NTT Laboratories for their helpful discussions. I would also like to thank the anonymous referees for their valuable comments.  ... 
doi:10.1007/bfb0052249 fatcat:nalsmqryzrgd3f62rtw4sbm3bu

Little Dragon Two: An efficient Multivariate Public Key Cryptosystem

Rajesh P Singh, Anupam Saikia, Sarma B. K
2010 International journal of network security and its applications  
In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon which was a variant a variant of Matsumoto Imai cryptosystem C*.  ...  In this paper we propose a cryptosystem Little Dragon Two which is as efficient as Little Dragon cryptosystem but secure against all the known attacks.  ...  Conclusion We have designed an efficient multivariate public key cryptosystem. Like Little Dragon Cryptosystem the public key is mixed type but quadratic.  ... 
doi:10.5121/ijnsa.2010.2201 fatcat:6hy6jd3xa5aw5mc7o4qlpn3zcu

A Practical Public Key Cryptosystem from Paillier and Rabin Schemes [chapter]

David Galindo, Sebastiá Martýn, Paz Morillo, Jorge L. Villar
2002 Lecture Notes in Computer Science  
This modification is reminiscent of the ones applied by Rabin [22] and Williams [25] to the well-known RSA cryptosystem.  ...  Compared to Okamoto-Uchiyama's scheme [18], the previous IND-CPA cryptosystem in the standard model with onewayness based on factoring, our scheme is drastically more efficient in encryption, and presents  ...  of RSA cryptosystem.  ... 
doi:10.1007/3-540-36288-6_21 fatcat:fqlpspal3zfidbdmxkubredkxy

Page 4939 of Mathematical Reviews Vol. , Issue 86j [page]

1986 Mathematical Reviews  
N. 86j:94048 Algorithm 121: RSA key calculation in Ada. Comput. J. 28 (1985), no. 3, 343-345.  ...  The authors explain a scheme using vectors of r polynomials to encipher elements of K”. The class of these polynomials contains inverses in a manner analogous to the preceding case.  ... 

Poly-Dragon: an efficient multivariate public key cryptosystem

Rajesh P. Singh, A. Saikia, B. K. Sarma
2011 Journal of Mathematical Cryptology  
Public key of our cryptosystem contains polynomials of total degree three in plaintext and ciphertext variables, two in plaintext variables and one in ciphertext variables.  ...  In this paper we propose an efficient multivariate public key cryptosystem.  ...  T r(x) = x + x 2 + x 2 2 + . . . + x 2 2 m−1 Some Permutation Polynomials In this section, we generate some families of permutation polynomials over F 2 n , which will be used for the proposed cryptosystem  ... 
doi:10.1515/jmc.2011.002 fatcat:xq32mwwyyzcn3iquw3wkj6p4l4

Cryptosystem with Rédei Rational Functions via Pellconics

P. AnuradhaKameswari, R. Chaya Kumari
2012 International Journal of Computer Applications  
In this paper, two cryptosystems are constructed using the fact that Rédei rational functions are permutation polynomials and exploiting the multiplicative properties of Rédei rational functions and the  ...  The connection between these evaluations and the convergents of solutions of Pell's equation are used in the construction of the second cryptosystem.  ...  This idea may be extended to other cryptosystems involving permutation polynomials. e  is made public.  ... 
doi:10.5120/8639-2054 fatcat:c4bgqpphzzcnhhmu4entd52ety

Analysis and Performance Characteristics of Cryptosystem using Image Files

A. NareshReddy, Rahesh Nayak, S. Baboo
2012 International Journal of Computer Applications  
The RSA and NTRU belong to the category of asymmetric key cryptosystem. RSA is one of the oldest and the most widely used public key cryptographic algorithms.  ...  NTRU (N th degree truncated Polynomial ring) is a collection of mathematical algorithms based on manipulating lists of very small Integers. NTRU is the first secure public key cryptosystem.  ...  These algorithms are based on mathematical calculations rather than substitutions and permutations like the symmetric cryptosystems.  ... 
doi:10.5120/8340-1561 fatcat:hc57c7awifdpfdqmgxuoxgtgde

An efficient probabilistic public-key cryptosystem over quadratic fields quotients

Guilhem Castagnos
2007 Finite Fields and Their Applications  
We present a new probabilistic cryptosystem working in quadratic fields quotients. Computation in such objects can be done efficiently with Lucas sequences which help to design a fast system.  ...  This system appears to be an alternative to schemes based on the RSA primitive and has a full computational cost smaller than the El Gamal EC cryptosystem.  ...  In [4] , the authors prove that to invert the RSA function is polynomially equivalent to the inversion of the E e function.  ... 
doi:10.1016/j.ffa.2006.05.004 fatcat:5wweofxi2nhilg5qbebkyxuwlq


Chanda Raju .
2016 International Journal of Research in Engineering and Technology  
Many theories proposed different encryption techniques (for example AES, DES, RSA etc.,) till the date, among those techniques one of the oldest encryption technique is McElice cryptography, based on the  ...  In this system the main concern is how much secured the user data is, in the shared environment.  ...  Encryption Process in McEliece Cryptosystem The following steps for encryption. 1.  ... 
doi:10.15623/ijret.2016.0519001 fatcat:26tmgsppt5a45c2hbt5h4wic2e

Page 1661 of Mathematical Reviews Vol. , Issue 87c [page]

1987 Mathematical Reviews  
Often complex- looking polynomial functions induce very simple permutations of the elements of a finite field and therefore are not suitable for the construction of cryptosystems.  ...  Some prop- erties of polynomials or polynomial functions on finite fields can be used for constructing cryptosystems.  ... 

Page 5927 of Mathematical Reviews Vol. , Issue 86m [page]

1986 Mathematical Reviews  
Author summary: “In the RSA public-key cryptosystem [R. L. Rivest, L. Adleman and A. Shamir, Comm.  ...  “In this paper we discuss an RSA-like public-key cryptosystem in which we raise a certain quadratic irrational to the power e modulo R.  ... 

Page 8753 of Mathematical Reviews Vol. , Issue 2002K [page]

2002 Mathematical Reviews  
In particular, the authors give a new algorithm on the Dickson polynomial g,(x,1) public key cryptosystem, i.e.  ...  Summary: “This paper proposes a systematic design of a digit- serial-in-serial-out systolic multiplier for the efficient implementa- tion of the Montgomery algorithm in an RSA cryptosystem.  ... 

An Efficient Encryption Algorithm for P2P Networks Robust Against Man-in-the-Middle Adversary [article]

Roohallah Rastaghi
2013 arXiv   pre-print
In this paper, we propose a new public-key cryptosystem for P2P networks that is robust against Man-in-the-Middle adversary. This cryptosystem is based on RSA and knapsack problems.  ...  Our precoding-based algorithm uses knapsack problem for performing permutation and padding random data to the message.  ...  To date, there doesn't exist a polynomial time algorithm for solving integerfactoring problem or solving RSA problem.  ... 
arXiv:1211.2338v3 fatcat:xxnjyp3auvfxlcaauownkdfsba

Message-aimed side channel and fault attacks against public key cryptosystems with homomorphic properties

Falko Strenzke
2011 Journal of Cryptographic Engineering  
In this work, we introduce a new timing vulnerability in the decryption operation of the McEliece cryptosystem.  ...  Furthermore, we review previously known side channel and fault attacks against the RSA and McEliece cryptosystems and analyze them with respect to their differences and similarities concerning the respective  ...  of the sources of critical timing differences in the RSA and McEliece cryptosystems.  ... 
doi:10.1007/s13389-011-0020-0 fatcat:du5wyqwqmvgermgqyu3diy6osu

Towards One Cycle per Bit Asymmetric Encryption: Code-Based Cryptography on Reconfigurable Hardware [chapter]

Stefan Heyse, Tim Güneysu
2012 Lecture Notes in Computer Science  
In the past, most researchers focused on the McEliece cryptosystem, neglecting the fact that the scheme by Niederreiter has some important advantages.  ...  Since both problems are known to be closely related, a major breakthrough in cryptanalysis tackling one of those problems could render a large set of cryptosystems completely useless.  ...  The work described in this paper has been supported in part by the European Commission through the ICT programme under contract ICT-2007-216676 ECRYPT II.  ... 
doi:10.1007/978-3-642-33027-8_20 fatcat:6vlnvgwubvew5edosj7c5comjq
« Previous Showing results 1 — 15 out of 1,590 results