Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for breakage (0.07 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. impl/maven-core/src/test/java/org/apache/maven/project/RepositoryLeakageTest.java

                // Check for leakage: child2 should NOT have child1's repository
                boolean child2HasChild1Repo = child2Project.getRemoteArtifactRepositories().stream()
                        .anyMatch(repo -> "child1-repo".equals(repo.getId()));
                assertFalse(child2HasChild1Repo, "Child2 should NOT have child1's repository (leakage detected!)");
    
                // Check for leakage in the shared request
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Thu Oct 16 06:12:36 GMT 2025
    - 9.3K bytes
    - Click Count (0)
  2. impl/maven-core/src/main/java/org/apache/maven/project/DefaultProjectBuilder.java

            private final ModelBuilder.ModelBuilderSession modelBuilderSession;
            private final Map<String, MavenProject> projectIndex = new ConcurrentHashMap<>(256);
    
            // Store computed repositories per project to avoid leakage between projects
            private final Map<String, List<ArtifactRepository>> projectRepositories = new ConcurrentHashMap<>();
    
            /**
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Tue Nov 18 17:20:31 GMT 2025
    - 51.8K bytes
    - Click Count (0)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    = p - q diff.ExpandFor(p).Sub(qP, p) } // A tiny bit of leakage is acceptable because it's not adaptive, an // attacker only learns the magnitude of p - q. if diff.BitLenVarTime() <= N.BitLen()/2-100 { return errors.New("crypto/rsa: |p - q| too small") } // Check that d > 2^(nlen/2). // // See section 3 of https://crypto.stanford.edu/~dabo/papers/RSA-survey.pdf // for more details about attacks on small d values. // // Likewise, the leakage of the magnitude of d is not adaptive. if priv.d.BitLenVarTime()...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  4. lib/fips140/v1.1.0-rc1.zip

    = p - q diff.ExpandFor(p).Sub(qP, p) } // A tiny bit of leakage is acceptable because it's not adaptive, an // attacker only learns the magnitude of p - q. if diff.BitLenVarTime() <= N.BitLen()/2-100 { return errors.New("crypto/rsa: |p - q| too small") } // Check that d > 2^(nlen/2). // // See section 3 of https://crypto.stanford.edu/~dabo/papers/RSA-survey.pdf // for more details about attacks on small d values. // // Likewise, the leakage of the magnitude of d is not adaptive. if priv.d.BitLenVarTime()...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top