Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "public key" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-10 z 22
Tytuł:
On Multivariate Cryptosystems Based on Computable Maps with Invertible Decomposition
Autorzy:
Ustimenko, V.
Powiązania:
https://bibliotekanauki.pl/articles/106324.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
multivariate map
invertible decomposition
public key infrastructure
Opis:
Let K be a commutative ring and K^n be a space over K of dimension n. We introduce the concept of a family of multivariate maps f(n) of K^n into itself with invertible decomposition.If f(n) is computable in polynomial time then it can be used as the public rule and the invertible decomposition provides a private key in f(n) based public key infrastructure. Requirementsof polynomial ity of degree and density for f(n) allow to estimate the complexity of encryption procedurefor a public user. The concepts of a stable family and a family of increasing order are motivatedby the studies of discrete logarithm problem in the Cremona group. The statement on the existenceof families of multivariate maps of polynomial degree and polynomial density of increasing order with the invertible decomposition is proved. The proof is supported by explicite construction which canbe used as a new cryptosystem. The presented multivariate encryption maps are induced by special walks in the algebraically dened extremal graphs A(n;K) and D(n;K) of increasing girth.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2014, 14, 1; 7-17
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-threshold signature
Autorzy:
Nakielski, B.
Pomykała, J.
Pomykała, J. A.
Powiązania:
https://bibliotekanauki.pl/articles/308529.pdf
Data publikacji:
2008
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
public key cryptography
threshold signature
multisignature
secret sharing
Opis:
The work presents a new signature scheme, called the multi-threshold signature, which generalizes the concept of multisignature and threshold signature. This scheme protects the anonymity of signers in a way the group signature does - in exceptional circumstances the identities of signers may be revealed. Due to the new party - completer, in our scheme the threshold size may vary together with the message to be signed. The presented scheme is based on the RSA signature standard, however other signature standards might be applied to it as well.
Źródło:
Journal of Telecommunications and Information Technology; 2008, 1; 51-55
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamical systems as the main instrument for the constructions of new quadratic families and their usage in cryptography
Autorzy:
Ustimenko, V.
Wroblewska, A.
Powiązania:
https://bibliotekanauki.pl/articles/106218.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
discrete logarithm
cryptographic algorithm
cryptography
public key cryptography
Opis:
Let K be a finite commutative ring and f = f(n) a bijective polynomial map f(n) of the Cartesian power K^n onto itself of a small degree c and of a large order. Let f^y be a multiple composition of f with itself in the group of all polynomial automorphisms, of free module K^n. The discrete logarithm problem with the pseudorandom base f(n) (solvef^y = b for y) is a hard task if n is sufficiently large. We will use families of algebraic graphs defined over K and corresponding dynamical systems for the explicit constructions of such maps f(n) of a large order with c = 2 such that all nonidentical powers f^y are quadratic polynomial maps. The above mentioned result is used in the cryptographical algorithms based on the maps f(n) – in the symbolic key exchange protocols and public keys algorithms.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2012, 12, 3; 65-74
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Implications of the arithmetic ratio of prime numbers for RSA security
Autorzy:
Ivanov, Andrey
Stoianov, Nikolai
Powiązania:
https://bibliotekanauki.pl/articles/2201016.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
public key cryptography
RSA encryption
public key generation rules
kleptography
fusion of number balance
kryptografia klucza publicznego
szyfrowanie RSA
kleptografia
bilans liczbowy
Opis:
The most commonly used public key cryptographic algorithms are based on the difficulty in solving mathematical problems such as the integer factorization problem (IFP), the discrete logarithm problem (DLP) and the elliptic curve discrete logarithm problem (ECDLP). In practice, one of the most often used cryptographic algorithms continues to be the RSA. The security of RSA is based on IFP and DLP. To achieve good data security for RSA-protected encryption, it is important to follow strict rules related to key generation domains. It is essential to use sufficiently large lengths of the key, reliable generation of prime numbers and others. In this paper the importance of the arithmetic ratio of the prime numbers which create the modular number of the RSA key is presented as a new point of view. The question whether all requirements for key generation rules applied up to now are enough in order to have good levels of cybersecurity for RSA based cryptographic systems is clarified.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2023, 33, 1; 57--70
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Certificate-less digital signature technology for e-Governance solutions
Autorzy:
Dhir, Shuchi
Devi, Sumithra
Powiązania:
https://bibliotekanauki.pl/articles/305692.pdf
Data publikacji:
2019
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
digital signatures
identity-based architecture
biometrics
fingerprint minutiae
RSA
private key
public key
Opis:
In spite of the fact that digital signing is an essential requirement for implementation of e-governance solutions in any organization, its use in large scale Government ICT implementation is negligible in India. In order to understand the reasons for low-level acceptance of the technology, authors performed a detailed study of a famous e-governance initiative of India. The outcome of the study revealed that the reasons are related to the challenges concerning the use of cryptographic devices carrying private key and the complicated process of generation, maintenance and disposal of Digital Signature Certificates (DSC). The solution, for the challenges understood from the case study, required implementation of a certificateless technology where private keys should be generated as and when required rather than storing them on cryptographic devices. Although many solutions which provide certificateless technology exist, to date there have been no practical implementation for using biometrics for implementing the solution. This paper presents the first realistic architecture to implement Identity Based Cryptography with biometrics using RSA algorithm. The solution presented in the paper is capable of providing a certificate-less digital signature technology to the users, where public and private keys are generated on-the-fly.
Źródło:
Computer Science; 2019, 20 (4); 431-452
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Block Cipher Based Public Key Encryption via Indistinguishability Obfuscation
Autorzy:
Horubała, A.
Waszkiewicz, D.
Andrzejczak, M.
Sapiecha, P.
Powiązania:
https://bibliotekanauki.pl/articles/226598.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
indistinguishability obfuscation
public key cryptosystems
homomorphic encryption
cloud computing
information protection
Opis:
The article is devoted to generation techniques of the new public key crypto-systems, which are based on application of indistinguishability obfuscation methods to selected private key crypto-systems. The techniques are applied to symmetric key crypto-system and the target system is asymmetric one. As an input for our approach an implementation of symmetric block cipher with a given private-key is considered. Different obfuscation methods are subjected to processing. The target system would be treated as a public-key for newly created public crypto-system. The approach seems to be interesting from theoretical point of view. Moreover, it can be useful for information protection in a cloud-computing model.
Źródło:
International Journal of Electronics and Telecommunications; 2018, 64, 2; 173-178
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new approach to the elgamal encryption scheme
Autorzy:
Kościelny, Cz.
Powiązania:
https://bibliotekanauki.pl/articles/907408.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
klucz publiczny
szyfr EIGamal
szyfr blokowy
public-key encryption
ElGamal cipher
block ciphers
Opis:
The ElGamal encryption scheme can be used for both digital signatures and encryption, and its security results from the difficulty of calculating discrete logarithms in a finite field. This algorithm usually works in a multiplicative group of GF(p) and in this case the progress in the discrete logarithm problem forces the users of such a basic ElGamal public key cryptosystem to permanently increase a prime modulus p in order to ensure the desired security. But the task of finding a multiplicative group of GF(p) is unfeasible for an ordinary user. It is possible to overcome this inconvenience by forming an ElGamal encryption scheme which works in a multiplicative group of GF(pm). Therefore, it is shown in the paper how to implement this cryptosystem for work in the multiplicative group of GF(pm), in its subgroup, and in an algebraic system named the spurious multiplicative group of GF(pm).
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 2; 265-267
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Asymmetric cryptography and practical security
Autorzy:
Pointcheval, D.
Powiązania:
https://bibliotekanauki.pl/articles/309405.pdf
Data publikacji:
2002
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
kryptografia
podpis cyfrowy
kryptografia asymetryczna
bezpieczeństwo
cryptography
digital signature
public-key encryption
provable security
random oracle model
Opis:
Since the appearance of public-key cryptography in Diffie-Hellman seminal paper, many schemes have been proposed, but many have been broken. Indeed, for many people, the simple fact that a cryptographic algorithm withstands cryptanalytic attacks for several years is considered as a kind of validation. But some schemes took a long time before being widely studied, and maybe thereafter being broken. A much more convincing line of research has tried to provide "provable" security for cryptographic protocols, in a complexity theory sense: if one can break the cryptographic protocol, one can efficiently solve the underlying problem. Unfortunately, very few practical schemes can be proven in this so-called "standard model" because such a security level rarely meets with efficiency. A convenient but recent way to achieve some kind of validation of efficient schemes has been to identify some concrete cryptographic objects with ideal random ones: hash functions are considered as behaving like random functions, in the so-called "random oracle model", block ciphers are assumed to provide perfectly independent and random permutations for each key in the "ideal cipher model", and groups are used as black-box groups in the "generic model". In this paper, we focus on practical asymmetric protocols together with their "reductionist" security proofs. We cover the two main goals that public-key cryptography is devoted to solve: authentication with digital signatures, and confidentiality with public-key encryption schemes.
Źródło:
Journal of Telecommunications and Information Technology; 2002, 4; 41-56
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Podpis elektroniczny w biznesie
Electronic Signature in Business
Autorzy:
Przyłuska-Schmitt, Judyta
Powiązania:
https://bibliotekanauki.pl/articles/30145479.pdf
Data publikacji:
2014
Wydawca:
Katolicki Uniwersytet Lubelski Jana Pawła II. Towarzystwo Naukowe KUL
Tematy:
podpis elektroniczny
infrastruktura
certyfikat kwalifikowany
klucz publiczny
klucz prywatny
obieg dokumentów
electronic signature
infrastructure
qualified certificate
public key
private key
workflow
Opis:
W dobie globalizacji informacja jest najbardziej pożądanym źródłem wiedzy i bezcennym towarem. Dzięki opracowywaniu coraz to szybszych i skuteczniejszych sposobów przekazywania wiadomości na duże odległości, trudno nam dziś wyobrazić sobie pracę bez użycia komputerów i coraz to lepszego oprogramowania. Zawieranie umów w drodze elektronicznej odbywa się na różne sposoby – poprzez wymianę mailową, wypełnianie formularzy na stronach internetowych, wykorzystywanie baz danych, programów społecznościowych, wreszcie – po elektroniczny podpis i e-dokumentowanie. Wszystko to dzieje się za sprawą nie tylko niemal powszechnego dostępu do Internetu, ale zwłaszcza poprzez ciągłe doskonalenie sposobów szyfrowania informacji, wzrost mocy obliczeniowej procesorów i dostosowanie prawa do wymogów e-rynków. Celem artykułu jest przybliżenie infrastruktury e-podpisu i obszarów jego zastosowania w biznesie.
In the era of globalization, the information is the most desirable source of knowledge and priceless commodity. With the development of ever faster and more efficient ways to communicate messages over long distances difficult for us to imagine working without the use of computers and increasingly better software. Conclusion of contracts by electronic means is carried out in various ways – through the exchange of mail, filling out forms on websites, use of databases, community programs, and finally – after the electronic signature and e-documents. All this happens not only because of nearly universal access to the Internet, but especially through continuous improvement of information encryption methods, the increase in computing power and alignment with the requirements of e-markets.
Źródło:
Roczniki Ekonomii i Zarządzania; 2014, 6, 2; 301-317
2081-1837
2544-5197
Pojawia się w:
Roczniki Ekonomii i Zarządzania
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Digital signature with secretly embedded warning
Autorzy:
Durnoga, K.
Pomykała, J.
Trabszys, T.
Powiązania:
https://bibliotekanauki.pl/articles/205996.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
public key cryptography
digital signature
one-way permutation
subliminal channel
deniable encryption
blackmail
secretly embedded warning
translucent sets
Opis:
We present a digital signature scheme with secretly embedded warning. The embedded warning is a protection mechanism in case of restraint or blackmail. Extending ordinary digital signatures we propose schemes where a signer, approached by a powerful adversary that demands handing over a signing key, can disclose his private key. In our solution the signer is able to generate a feigned key indistinguishable from the genuine one. Then such a key can be used to embed a special warning message within a signature to indicate coercion. Such warnings can be transferred via subliminal channel to some trusted authority.
Źródło:
Control and Cybernetics; 2013, 42, 4; 805-824
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-10 z 22

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies