AI & ChatGPT searches , social queriess for RSA PROBLEM
Search references for RSA PROBLEM. Phrases containing RSA PROBLEM
See searches and references containing RSA PROBLEM!
Search references for RSA PROBLEM. Phrases containing RSA PROBLEM
See searches and references containing RSA PROBLEM!RSA PROBLEM
Unsolved problem in cryptography
In cryptography, the RSA problem summarizes the task of performing an RSA private-key operation given only the public key. The RSA algorithm raises a message
RSA_problem
Algorithm for public-key cryptography
security of RSA is related to the difficulty of factoring the product of two large prime numbers, the "factoring problem". Breaking RSA encryption is
RSA_cryptosystem
Scheme often used with RSA encryption
asymmetric encryption padding (OAEP) is a padding scheme often used together with RSA encryption. OAEP was introduced by Bellare and Rogaway, and subsequently
Optimal asymmetric encryption padding
Optimal_asymmetric_encryption_padding
Decomposition of a number into a product
integers or a related problem – for example, the RSA problem. An algorithm that efficiently factors an arbitrary integer would render RSA-based public-key
Integer_factorization
Approach to public-key cryptography
determine the difficulty of the problem. The primary benefit promised by elliptic curve cryptography over alternatives such as RSA is a smaller key size, reducing
Elliptic-curve_cryptography
Hypothesis in computational complexity theory
include the quadratic residuosity problem and the decisional composite residuosity problem. As in the case of RSA, this problem (and its special cases) are
Computational hardness assumption
Computational_hardness_assumption
Signature padding scheme for RSA
analysis to prove that its security directly relates to that of the RSA problem. There is no such proof for the traditional PKCS#1 v1.5 scheme. OpenSSL
Probabilistic signature scheme
Probabilistic_signature_scheme
Cryptographic algorithm for digital signatures
libgcrypt LibreSSL mbed TLS Microsoft CryptoAPI OpenSSL wolfCrypt EdDSA RSA (cryptosystem) Johnson, Don; Menezes, Alfred (1999). "The Elliptic Curve
Elliptic Curve Digital Signature Algorithm
Elliptic_Curve_Digital_Signature_Algorithm
Quantum-safe key encapsulation mechanism
problem, in conjunction with cyclotomic rings. Recently, there has also been a tight formal mathematical security reduction of the ring-LWE problem to
ML-KEM
Practice and study of secure communication techniques
complexity of "hard" problems, often from number theory. For example, the hardness of RSA is related to the integer factorization problem, while Diffie–Hellman
Cryptography
Digital verification standard
already invested effort in developing digital signature software based on the RSA cryptosystem. Nevertheless, NIST adopted DSA as a Federal standard (FIPS
Digital_Signature_Algorithm
Project by NIST to standardize post-quantum cryptography
acknowledge the possibility of quantum technology to render the commonly used RSA algorithm insecure by 2030. As a result, a need to standardize quantum-secure
NIST Post-Quantum Cryptography Standardization
NIST_Post-Quantum_Cryptography_Standardization
System that can issue, distribute and verify digital certificates
Certificate Validity reduced to 13 Months. An alternative approach to the problem of public authentication of public key information is the web-of-trust
Public_key_infrastructure
Key agreement protocol
it), unless that party can solve the elliptic curve discrete logarithm problem. Bob's private key is similarly secure. No party other than Alice or Bob
Elliptic-curve_Diffie–Hellman
Challenge for factoring large semiprimes
The RSA Factoring Challenge was a challenge put forward by RSA Laboratories on March 18, 1991 to encourage research into computational number theory and
RSA_Factoring_Challenge
Digital signature scheme
key and message, there is only one valid signature (like RSA PKCS1 v1.5, RSA-FDH and unlike RSA-PSS, DSA, ECDSA, Schnorr and ML-DSA). Signature Aggregation:
BLS_digital_signature
Public-key cryptosystem
Diffie-Hellman Assumptions and an Analysis of DHIES". Topics in Cryptology — CT-RSA 2001. Lecture Notes in Computer Science. Vol. 2020. pp. 143–158. doi:10
ElGamal_encryption
Method of exchanging cryptographic keys
schemes, such as RSA, finite-field DH and elliptic-curve DH key-exchange protocols, using Shor's algorithm for solving the factoring problem, the discrete
Diffie–Hellman_key_exchange
Mechanism for authenticating cryptographic keys
and has continued to function with little change. However, a related problem does occur: users, whether individuals or organizations, who lose track
Web_of_trust
Mathematical scheme for verifying the authenticity of digital documents
invented the RSA algorithm, which could be used to produce primitive digital signatures (although only as a proof-of-concept – "plain" RSA signatures are
Digital_signature
Cryptographic method
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
Falcon_(signature_scheme)
Set of cryptographic algorithms by the NSA
protection up to TOP SECRET level. The CNSA 1.0 transition is notable for moving RSA from a temporary legacy status, as it appeared in Suite B, to supported status
Commercial National Security Algorithm Suite
Commercial_National_Security_Algorithm_Suite
Type of cryptosystem
system with complete threshold properties for a trapdoor function (such as RSA) and a proof of security was published in 1994 by Alfredo De Santis, Yvo
Threshold_cryptosystem
Non-federated cryptographic protocol
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
Signal_Protocol
Form of public key cryptography
knapsack problem using B {\displaystyle B} into an easy knapsack problem using W {\displaystyle W} . Unlike some other public key cryptosystems such as RSA, the
Merkle–Hellman knapsack cryptosystem
Merkle–Hellman_knapsack_cryptosystem
In cryptography, the strong RSA assumption states that the RSA problem is intractable even when the solver is allowed to choose the public exponent e (for
Strong_RSA_assumption
Digital signature scheme
traditional digital signatures such as the Digital Signature Algorithm or RSA. NIST has approved specific variants of the Merkle signature scheme in 2020
Merkle_signature_scheme
Cryptographic key management algorithm
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
Double_Ratchet_Algorithm
American computer security company
RSA Security LLC, formerly RSA Security, Inc. and trade name RSA, is an American computer and network security company with a focus on encryption and decryption
RSA_Security
Post-quantum digital signature scheme
E_{2}} . The fundamental problem that isogeny-based cryptography like SQIsign is based on is called the isogeny path problem and can be formulated as
SQIsign
Short sequence of bytes used to authenticate or look up a longer public key
to authenticate a much larger public key. For example, whereas a typical RSA public key will be 2048 bits in length or longer, typical MD5 or SHA-1 fingerprints
Public_key_fingerprint
Augmented password-authenticated key exchange protocol
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
Secure Remote Password protocol
Secure_Remote_Password_protocol
Algorithm for public key cryptography
a probabilistic asymmetric algorithm for public key cryptography. The problem of computing n-th residue classes is believed to be computationally difficult
Paillier_cryptosystem
Number of integers coprime to and less than n
this is known as the RSA problem which can be solved by factoring n. The owner of the private key knows the factorization, since an RSA private key is constructed
Euler's_totient_function
Key management protocol
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
Oakley_protocol
Asymmetric key encryption algorithm
used in GM encryption is generated in the same manner as in the RSA cryptosystem. (See RSA, key generation for details.) Alice generates two distinct large
Goldwasser–Micali cryptosystem
Goldwasser–Micali_cryptosystem
Digital signature scheme
security is based on the intractability of certain discrete logarithm problems. It is efficient and generates short signatures. It was covered by U.S
Schnorr_signature
Asymmetric key encryption algorithm
additional assumptions (e.g., hardness of the quadratic residuosity problem or the RSA problem). Secondly, BG is efficient in terms of storage, inducing a constant-size
Blum–Goldwasser_cryptosystem
as efficient as with cryptosystems based on elliptic curves or factoring (RSA). The efficiency of implementing the arithmetic depends on the underlying
Hyperelliptic curve cryptography
Hyperelliptic_curve_cryptography
Chip encryption algorithm by Intel
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
Enhanced_privacy_ID
1999 public-key cryptography algorithm
describing already existing cryptographic techniques from the Caesar cipher to RSA. This had won her the Intel Student Award which included the opportunity
Cayley–Purser_algorithm
Two-Party Identity-Based Authenticated Key Agreement". Topics in Cryptology – CT-RSA 2005. Lecture Notes in Computer Science. Vol. 3376. Green, Matthew; Miers
Identity-based_cryptography
p. This is very similar to the quadratic residuosity problem and the higher residuosity problem. Okamoto, Tatsuaki; Uchiyama, Shigenori (1998). "A new
Okamoto–Uchiyama_cryptosystem
IEEE standardization project for public-key cryptography
Former chairs were Ari Singer, also of NTRU (1999–2001), and Burt Kaliski of RSA Security (1994–1999). The IEEE Standard Association withdrew all of the 1363
IEEE_P1363
Cryptographic signature scheme
computers threatens the security of many common forms of cryptography, such as RSA, it is believed that Lamport signatures with large hash functions would still
Lamport_signature
Multiparty cryptographic process
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
Distributed_key_generation
Niederreiter (1986). "Knapsack-type cryptosystems and algebraic coding theory". Problems of Control and Information Theory. Problemy Upravlenija I Teorii Informacii
Niederreiter_cryptosystem
Hybrid encryption in cryptography
The security of the scheme is based on the computational Diffie–Hellman problem. Two variants of IES are specified: Discrete Logarithm Integrated Encryption
Integrated_Encryption_Scheme
Public-key encryption scheme
encryption schemes based on a trapdoor function whose security, like that of RSA, is related to the difficulty of integer factorization. The Rabin trapdoor
Rabin_cryptosystem
Digital signature resilient to quantum cryptography
digital signature algorithms based on hard problems in lattices are being created to replace the commonly used RSA and elliptic curve signatures. A subset
Ring learning with errors signature
Ring_learning_with_errors_signature
computations modulo n s + 1 {\displaystyle n^{s+1}} where n {\displaystyle n} is an RSA modulus and s {\displaystyle s} a (positive) natural number. Paillier's scheme
Damgård–Jurik_cryptosystem
Public-key exchange protocol
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
MQV
non-commutative cryptography, the currently widely used public-key cryptosystems like RSA cryptosystem, Diffie–Hellman key exchange and elliptic curve cryptography
Non-commutative_cryptography
Type of cryptographic smart card
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
OpenPGP_card
Public-key cryptosystem
approach is simpler to implement, and provides a tighter reduction to the RSA problem, than padding schemes like RSAES-OAEP. Traditional Elgamal encryption
Key_encapsulation_mechanism
Lattice-based public key cryptosystem
NTRU lattice-based alternative to RSA and elliptic curve cryptography (ECC) and is based on the shortest vector problem in a lattice (which is not known
NTRUEncrypt
Probability of shared birthdays
Size Scaling in the Integer Partition Problem". Random Structures and Algorithms. 19 (3–4): 247–288. doi:10.1002/rsa.10004. S2CID 6819493. Abramson, M.;
Birthday_problem
Assumption used in cryptographic systems
(DDH) assumption is a computational hardness assumption about a certain problem involving discrete logarithms in cyclic groups. It is used as the basis
Decisional Diffie–Hellman assumption
Decisional_Diffie–Hellman_assumption
NTRU public-key cryptography digital signature algorithm
rump session of Asiacrypt 2001 and published in peer-reviewed form at the RSA Conference 2003. The 2003 publication included parameter recommendations
NTRUSign
Digital signature scheme
properties of modular exponentiation, together with the discrete logarithm problem. The algorithm uses a key pair consisting of a public key and a private
ElGamal_signature_scheme
Cryptographic key agreement scheme
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
Station-to-Station_protocol
Public-key cryptographic pseudorandom function
function thus proposed, which is provably secure if a variant of the RSA problem is hard, is defined as follows: The public key PK is ( m , r , Q , c
Verifiable_random_function
Cryptographic scheme
The security of the above commitment relies on the hardness of the RSA problem and has perfect hiding and computational binding. The Pedersen commitment
Commitment_scheme
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
Implicit_certificate
and space. The security of this scheme rests on the Higher residuosity problem, specifically, given z,r and n where the factorization of n is unknown
Benaloh_cryptosystem
Asymmetric encryption algorithm developed by Robert McEliece
decoding. The McEliece cryptosystem has some advantages over, for example, RSA. The encryption and decryption are faster. For a long time, it was thought
McEliece_cryptosystem
Cryptographic protocol
Conjugacy Search Problem (GSCSP) within the braid group. This is a distinct and different hard problem than the Conjugacy Search Problem (CSP), which has
Algebraic_Eraser
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
SPEKE
Asymmetric key encryption algorithm
practical adaptive chosen ciphertext attack against SSL servers using a form of RSA encryption. Cramer–Shoup was not the first encryption scheme to provide security
Cramer–Shoup_cryptosystem
Security system
security. This system is based on a type of knapsack problem. Specifically, the underlying problem is this: given integers c,n,p and v0,...,vn, find a
Naccache–Stern knapsack cryptosystem
Naccache–Stern_knapsack_cryptosystem
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
Transient-key_cryptography
Unsolved problem in computer science
systems, such as the RSA algorithm. The integer factorization problem is in NP and in co-NP (and even in UP and co-UP). If the problem is NP-complete, the
P_versus_NP_problem
Cryptography library
formerly known as RSA BSAFE, is a FIPS 140-2 validated cryptography library, available in both C and Java. BSAFE was initially created by RSA Security, which
BSAFE
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
Encrypted_key_exchange
Public-key security system
public-key cryptosystem whose security rests on the higher residuosity problem. The Naccache–Stern cryptosystem was discovered by David Naccache and Jacques
Naccache–Stern_cryptosystem
Family of Israeli ballistic missiles
African series of missiles, of which the RSA-3 are believed to be licensed copies of the Jericho II/Shavit, and the RSA-4 that used part of these systems in
Jericho_(missile)
mathematical problems involving lattices. Unlike older lattice based cryptographic algorithms, the RLWE-KEX is provably reducible to a known hard problem in lattices
Ring learning with errors key exchange
Ring_learning_with_errors_key_exchange
mathematical problem, such as finding short vectors in lattices (SIS) as for ML-DSA and Falcon. Fortunately, the task of solving these problems remains infeasible
Quantum_digital_signature
Cryptography framework
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
Three-pass_protocol
q {\displaystyle q} in bits. To achieve security comparable to 1024-bit RSA, we should choose 6 P {\displaystyle 6P} about 1024, i.e. P ≈ 170 {\displaystyle
XTR
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
Efficient Probabilistic Public-Key Encryption Scheme
Efficient_Probabilistic_Public-Key_Encryption_Scheme
Cryptographic protocol designed to resist quantum computer attacks
to resist quantum computer attacks. NewHope is based on a mathematical problem ring learning with errors (RLWE) that is believed to be difficult to solve
NewHope
Japanese cryptography research project
March 2023[update] Public key ciphers Signature DSA ECDSA EdDSA RSA-PSS RSASSA-PKCS1-v1_5 Confidentiality RSA-OAEP Key exchange DH ECDH Symmetric key ciphers 64-bit
CRYPTREC
Cryptosystem
CEILIDH is a public key cryptosystem based on the discrete logarithm problem in algebraic torus. This idea was first introduced by Alice Silverberg and
CEILIDH
Asymmetric cryptographic technique based on integer factorisation
= c d mod p q , {\displaystyle m=c^{d}\mod pq,} which like for Rabin and RSA can be computed with the Chinese remainder theorem. Example: p = 7 , q =
Schmidt-Samoa_cryptosystem
Public key cryptosystem
on the hardness of the problem of finding solutions to a system of multivariate quadratic equations (the so-called MQ problem) since it uses private affine
Hidden_Field_Equations
Digital signature algorithm
Rivest. As with RSA the security of the system is related to the difficulty of factoring very large numbers. But, in contrast to RSA, GMR is secure against
GMR_(cryptography)
Post-quantum signature scheme
factorization, discrete logarithm or elliptic curve discrete logarithm problem, all of which can be effectively attacked by a quantum computer. BLISS
BLISS_signature_scheme
Archive file format storing cryptography objects
of standards called Public-Key Cryptography Standards (PKCS) published by RSA Laboratories. The filename extension for PKCS #12 files is .p12 or .pfx.
PKCS_12
statistics in the Republic of Ireland are compiled by the Road Safety Authority (RSA) using data supplied by the Garda Síochána (police). While related data is
List of road traffic accidents deaths in the Republic of Ireland by year
List_of_road_traffic_accidents_deaths_in_the_Republic_of_Ireland_by_year
European cryptographic research project
Telephone Corp RSA-KEM*: RSA key exchange mechanism (draft of ISO/IEC 18033-2) ACE Encrypt#: IBM Zurich Research Laboratory RSA-PSS: RSA Laboratories ECDSA:
NESSIE
BOINC based volunteer computing project researching prime numbers
the RSA factoring challenge trying to factor RSA-640. After RSA-640 was factored by an outside team in November 2005, the project moved on to RSA-768
PrimeGrid
Controversial pseudorandom number generator
paid RSA Security $10 million in a secret deal to use Dual_EC_DRBG as the default in the RSA BSAFE cryptography library, which resulted in RSA Security
Dual_EC_DRBG
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
Wireless Public Key Infrastructure
Wireless_Public_Key_Infrastructure
Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Tropical cryptography Standardization CRYPTREC IEEE
Sub-group_hiding
American cryptographer (born 1947)
Information Security Group. Rivest was a founder of RSA Data Security (now merged with Security Dynamics to form RSA Security), Verisign, and of Peppercoin. His
Ron_Rivest
Cryptographic system with public and private keys
factorization problem used to create a trapdoor function. In July 1996, mathematician Solomon W. Golomb said: "Jevons anticipated a key feature of the RSA Algorithm
Public-key_cryptography
Mathematics problem
The 100 prisoners problem is a mathematical problem in probability theory and combinatorics. In this problem, 100 numbered prisoners must find their own
100_prisoners_problem
Cryptographic solution
solution to a challenge ciphertext posed by the inventors of the RSA cipher in 1977. The problem appeared in Martin Gardner's Mathematical Games column in the
The Magic Words are Squeamish Ossifrage
The_Magic_Words_are_Squeamish_Ossifrage
Non paper-based authority or certificate
of knowledge based on the discrete logarithm problem for groups of known order and the special RSA problem for groups of hidden order form the foundation
Digital_credential
RSA PROBLEM
RSA PROBLEM
Male
Finnish
Finnish form of Greek Esaias, ESA means "God is salvation."
Female
Egyptian
, The Good Ra.
Male
English
 Short form of English Isaac, ISA means "he will laugh." Compare with another form of Isa.
Female
Gaelic
Irish Gaelic form of Spanish Theresa, TOIRÉASA means "harvester."
Female
Portuguese
Feminine form of Portuguese Desidério, DESIDÉRIA means "longing."
Female
Irish
Contracted form of Irish Gaelic Toiréasa, TRÉASA means "harvester."
Female
Hungarian
Hungarian form of Russian Roza, RÓZSA means "rose."
Female
Irish
Irish form of Spanish Theresa, TOIRÉASA means "harvester."
Female
Portuguese
Portuguese form of Latin Gloria, GLÓRIA means "glory."
Female
Portuguese
Portuguese form of Roman Latin Victoria, VITÓRIA means "conqueror" or "victory."
Female
Spanish
 Spanish name RIA means "small river." Compare with another form of Ria.
Boy/Male
Arabic, Muslim
Father of Isa
Female
Hungarian
Hungarian form of Roman Latin Victoria, VIKTÓRIA means "conqueror" or "victory."
Female
Hungarian
Hungarian form of Greek Martha, MÃRTA means "lady, mistress."Â
Female
Spanish
Feminine form of Spanish Berenguer, BERENGÃRIA means "bear-spear."
Female
English
 Medieval Latin name ROSA means "rose." Compare with another form of Rosa.
Female
Hungarian
Variant spelling of Hungarian Zsazsa, ZSA ZSA means "lily."Â
Female
Swedish
Swedish form of English Margaret, MÄRTA means "pearl."
Female
Hungarian
Hungarian and Slovak form of Greek Maria, MÃRIA means "obstinacy, rebelliousness" or "their rebellion."
Female
Portuguese
Portuguese form of Spanish Candelaria, CANDELÃRIA means "candle."
RSA PROBLEM
RSA PROBLEM
Male
Spanish
Pet form of Spanish Manuel, MANOLO means "God is with us."Â
Female
German
Pet form of German Friederike, FRIEDA means "peaceful ruler."
Boy/Male
Hindu
Boy/Male
Tamil
Durvasa | தà¯à®°à¯à®µà®¾à®¸à®¾
(A powerful rishi famous for his quick temper. The Puranas and Mahabharata contain many stories about Durvasa.)
Boy/Male
Tamil
Mighty
Girl/Female
Indian
One light
Male
Native American
Native American Algonquin name CHOGAN means "blackbird."
Boy/Male
Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Mythological, Tamil, Telugu
Lord Shiva
Girl/Female
Hindu
Having peace, Cool
Girl/Female
Gujarati, Hindu, Indian, Kannada, Sindhi, Tamil, Telugu
That which is Already been Performed; Friendship
RSA PROBLEM
RSA PROBLEM
RSA PROBLEM
RSA PROBLEM
RSA PROBLEM
n.
Either one of the Bears. See the Phrases below.
pl.
of Sacrarium
n.
A roe; a deer.
n.
The fruit of a rosebush, especially of the English dog-rose (Rosa canina).
n.
An East Indian deer (Rusa Aristotelis) having a mane on its neck. Its antlers have but three prongs. Called also gerow. The name is applied to other species of the genus Rusa, as the Bornean sambur (R. equina).
n.
A kind of rose (Rosa rubiginosa) with minutely glandular and fragrant foliage. The small-flowered sweetbrier is Rosa micrantha.
n.
See 2d Reis.
a.
Of, like, or pertaining to, a deer of the genus Rusa, which includes the sambur deer (Rusa Aristotelis) of India.
n.
A plant with a slender woody stem bearing stout prickles; especially, species of Rosa, Rubus, and Smilax.
n.
An ancient name of a gum.
n.
The constellation Charles's Wain, or Ursa Major. See Ursa major, under Ursa.
n.
One of two constellations in the northern hemisphere, called respectively the Great Bear and the Lesser Bear, or Ursa Major and Ursa Minor.
n.
A species of rose (Rosa Eglanteria), with fragrant foliage and flowers of various colors.
n.
The constellation Ursa Major.